Scheduling preemptable tasks on parallel processors with limited availability

It is well known that in the majority of cases the problem of preemptive task scheduling on m parallel identical processors with the objective of minimizing makespan can be solved in polynomial time. For example, for tree-like precedence constraints the algorithm of Muntz and CoAman can be applied. In this paper, this problem is generalized to cover the case of parallel processors which are available in certain time intervals only. It will be shown that this problem becomes NP-hard in the strong sense in case of trees and identical processors. If tasks form chains and are processed by identical processors with a staircase pattern of availability, the problem can be solved in low-order polynomial time for Cmax criterion, and a linear programming approach is required for Lmax criterion. Network flow and linear programming approaches will be proposed for independent tasks scheduled on, respectively, uniform and unrelated processors with arbitrary patterns of availability for schedule length and maximum lateness criteria. ” 2000 Published by Elsevier Science B.V. All rights reserved.

[1]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

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

[3]  V. G. Vizing.  Minimization of the maximum delay in servicing systems with interruption , 1982 .

[4]  Joseph Y.-T. Leung,et al.  On-Line Scheduling of Real-Time Tasks , 1992, IEEE Trans. Computers.

[5]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[7]  Lucio Bianco,et al.  Preemptive multiprocessor task scheduling with release times and time windows , 1997, Ann. Oper. Res..

[8]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

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

[10]  Danny Dolev,et al.  Scheduling Flat Graphs , 1985, SIAM J. Comput..

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

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

[13]  C. L. Liu,et al.  Introduction to Combinatorial Mathematics. , 1971 .

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

[15]  Chung-Yee Lee,et al.  Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint , 1997, Oper. Res. Lett..

[16]  Teofilo F. Gonzalez,et al.  Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.

[17]  Edward G. Coffman,et al.  Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems , 1970, JACM.

[18]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[19]  Zhen Liu,et al.  Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates , 1995, Discret. Appl. Math..

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