In this paper, we examine the utility of exploiting idle memory in workstation pools. We attempt to answer the following questions. First, given a workstation pool, what fraction of the memory can be expected to be idle? This provides an estimate of the opportunity for hosting guest data. Second, what fraction of a individual host' s memory can be expected to be idle? This helps determine the r...

The ability to define in-field tractor load states offers the potential to better specify and characterize fuel consumption rate for various field operations. For the same field operation, the tractor experiences diverse load demands and corresponding fuel use rates as it maneuvers through straight passes, turns, suspended operation for adjustments, repair and maintenance, and biomass or other ...

In shop scheduling, several applications exist where it is required that some components perform consecutively. We refer to no-idle schedules if machines are required to operate with no inserted idle time and no-wait schedules if tasks cannot wait between the end of an operation and the start of the following one. We consider here no-idle/no-wait shop scheduling problems with makespan as perfor...

spend much of their time idle, and various schemes have been proposed to use this idle time productively. We have used this approach to improve overall performance in storage systems. The most common approach is to off-load activity from busy periods to less-busy ones in order to improve system responsiveness. In addition, speculative work can be performed in idle periods in the hope that it wi...

Economic lot size scheduling problem (ELSP) for a multi-product single machine system is a classical problem. This paper considers ELSP with budgetary constraint as an important aspect of such systems. In the real world situations the available funds for investment in inventory is limited. By adopting the common cycle time approach to ELSP, we obtain the optimal common cycle which minimizes the...