although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

This paper considers the single machine scheduling problem with linear earliness and quadratic tardiness costs. The research on the version with inserted idle time focused on an exact approach, while several heuristics had already been proposed for the version with no idle time. These heuristics were then the basis for the development of new heuristic procedures for the version with idle time. ...

In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...

Even a fully loaded computer system, where the bottleneck resource is constantly busy, often has some idle capacities available on other resources. This proposal argues for using these idle capacities speculatively, increasing system performance for correct predictions. In such a system, all resources will ideally be constantly loaded with either regular foreground tasks, or speculative idle-ti...

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 ...