Abstract
In this paper, we give an overview of the main results obtained on the complexity of scheduling under the non-idling constraint, i.e, when the jobs assigned to each machine must be processed with no intermediate delay. That constraint is met in practice when the cost of intermediate idle time is too high due to the idle time itself and/or the machine restarting. The non idling constraint is a strong constraint that often needs a new solving approach and most results about classical scheduling problems do not easily extend to the non-idling variant of the problem. In this survey, we mainly consider the non-idling variants of the basic scheduling problems. So, we first present basic properties, complexity results and some algorithms concerning the one-machine non-idling scheduling problem. Then we consider the \(m\)-machine non idling scheduling problem. We show that a few basic problems may be solved by rather easy extensions of the algorithm solving their classical counterpart. However, the complexity status of the non idling version of quite easy polynomial basic problems remains an open question. We finally consider a more constrained version of non-idling, called the “homogeneously non idling” constraint, where for any subset of machines, the union of their busy intervals must make an interval and we present the structural property that leads to a polynomial algorithm for unit time jobs and a weak precedence. We conclude by giving some research directions that seem quite interesting to study both for theoretical and practical issues.
Similar content being viewed by others
References
Baker KR, Lawler EL, Lenstra JK, Rinnoy Kan AHG (1983) Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Oper Res 31:381–386
Baptiste P (2005) Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for off-line dynamic power management. Research Report, Laboratoire d’Informatique CNRS LIX
Brucker P (2004) Scheduling algorithms. Springer, Berlin
Carlier J, Moukrim A, Guédira K (2010) Exact resolution of the ne-machine sequencing problem with no machine idle time. Comput Ind Eng 59(2):193–199
Chrétienne P (2008) On single-machine scheduling without intermediate delays. Discret Appl Math 13(156):2543–2550
Coffman EG, Graham RL (1972) Optimal scheduling for two processor systems. Acta Inform 1:200–213
Hu TC (1961) Parallel sequencing and assemble line problems. Oper Res 9:841–848
Jouglet A (2012) Single-machine scheduling with no idle time and release dates to minimize a regular criterion. J Sched 15(2):217–238
Kacem I, Kellerer H (2014) Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Discret Appl Math 164:154–160
Landis K (1993) Group Technology and Cellular Manufacturing in the Westvaco Los Angeles VH Department. Project Report in IOM 581, School of Business, University of Southern california
Lenstra JK, Rinnoy Kan AHG (1978) Complexity of scheduling under precedence constraints. Oper Res 26(1):22–35
Pruhs K (2005) Algorithmic problems in power management, vol 36. ACM Press, New York, USA
Quilliot A, Chrétienne P (2013) Homogeneously non-idling schedules of unit-time jobs on identical parallel machine. Discret Appl Math 161(10–11):1586–1597
Quilliot A, Chrétienne P (2013) A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machine. In: Procceedings of MISTA 2013, Gent, Belgium
Valente JMS, Alves RAFS (2005) An exact approach to early/tardy scheduling with releases dates. Comput Oper Res 32:2905–2917
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chrétienne, P. On scheduling with the non-idling constraint. 4OR-Q J Oper Res 12, 101–121 (2014). https://doi.org/10.1007/s10288-014-0257-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-014-0257-4