Parallel machine scheduling with machine availability and eligibility constraints

In this paper we consider the problem of scheduling n independent jobs on m identical machines incorporating machine availability and eligibility constraints while minimizing the makespan. Each machine is not continuously available at all times and each job can only be processed on specified machines. A network flow approach is used to formulate this scheduling problem into a series of maximum flow problems. We propose a polynomial time binary search algorithm to either verify the infeasibility of the problem or solve it optimally if a feasible schedule exists.

[1]  Z Liu,et al.  Scheduling Theory and its Applications , 1997 .

[2]  Wieslaw Kubiak,et al.  Scheduling preemptable tasks on parallel processors with limited availability , 2000, Parallel Comput..

[3]  Jacek Blazewicz,et al.  Scheduling multiprocessor tasks on parallel processors with limited availability , 2003, Eur. J. Oper. Res..

[4]  Günter Schmidt,et al.  Scheduling on semi-identical processors , 1984, Z. Oper. Research.

[5]  Eric Sanlaville,et al.  Nearly on Line Scheduling of Preemptive Independent Tasks , 1995, Discret. Appl. Math..

[6]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[7]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[8]  H.-C. Hwang,et al.  Parallel Machines Scheduling with Machine Shutdowns , 1998 .

[9]  Awi Federgruen,et al.  Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques , 1986 .

[10]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[11]  Günter Schmidt,et al.  Scheduling Independent Tasks with Deadlines on Semi-identical Processors , 1988 .

[12]  Rhonda Righter.  Scheduling Computer and Manufacturing Processes (Second Edition). Jacek Błazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt and Jan Wȩglarz, Springer, Berlin, ISBN 3‐540‐41931‐4 , 2002 .

[13]  Chung-Yee Lee,et al.  Parallel machines scheduling with nonsimultaneous machine available time , 1991, Discret. Appl. Math..

[14]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[15]  Chung-Lun Li,et al.  Scheduling with processing set restrictions: A survey , 2008 .

[16]  W. Pulleyblank.  Progress in combinatorial optimization , 1985 .

[17]  Michael Pinedo,et al.  Current trends in deterministic scheduling , 1997, Ann. Oper. Res..

[18]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[19]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[20]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[21]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[22]  Chung-Yee Lee,et al.  A note on "parallel machine scheduling with non-simultaneous machine available time" , 2000, Discret. Appl. Math..

[23]  H. Kellerer.  Algorithms for multiprocessor scheduling with machine release times , 1998 .

[24]  Charles U. Martel.  Scheduling Uniform Machines with Release Times, Deadlines and Due Times , 1982 .

[25]  Grisselle Centeno,et al.  Parallel machine scheduling with release time and machine eligibility restrictions , 1997 .

[26]  Grissele Centeno,et al.  Minimizing makespan on parallel machines with release time and machine eligibility restrictions , 2004 .

[27]  Wenhua Li,et al.  Parallel machine scheduling of machine-dependent jobs with unit-length , 2004, Eur. J. Oper. Res..

[28]  Eric Sanlaville,et al.  Machine scheduling with availability constraints , 1998, Acta Informatica.

[29]  Eugene L. Lawler,et al.  Preemptive scheduling of uniform machines subject to release dates : (preprint) , 1979 .

[30]  Kevin Mahon,et al.  Deterministic and Stochastic Scheduling , 1983 .