Scheduling preemptable tasks on parallel processors with limited availability

Parallel Computing

Volumn 26, Issue 9, 2000, Pages 1195-1211

  Blazewicz, Jacek ^a   Drozdowski, Maciej ^a   Formanowicz, Piotr ^a   Kubiak, Wieslaw ^b   Schmidt, Günter ^c  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^c SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LINEAR PROGRAMMING; POLYNOMIALS;

PREEMPTIVE SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 0033689578     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(00)00035-1     Document Type: Article

References (20)

1. Bianco L., B l ażewicz J., Dell'Olmo P., Drozdowski M. Preemptive multiprocessor task scheduling with release times and time windows. Annals of Operations Research. 70:1997;43-55.
2. B l ażewicz J., Cellary W., S l owiński R., Wȩglarz J. Deterministyczne problemy szeregowania zadan na rownoleglych procesorach, Cz. I. Zbiory zadan zaleznych. Podstawy sterowania. 6:1976;155-178.
3. J. Bl ażewicz, K. Ecker, E. Pesch, G. Schmidt, J. Wȩglarz, Scheduling Computer and Manufacturing Processes, Springer, Berlin, 1996.
4. D. Dolev, M. Warmuth, Scheduling flat graphs, SIAM Journal on Computing 14 (3) (1985) 638-657.
5. Federgruen A., Groenevelt H. Preemptive scheduling of uniform processors by ordinary network flow techniques. Management Science. 32:1986;341-349.
6. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, San Francisco, 1979.
7. Graham R.L., Lawler E.L., Lenstra J.K., Rinnoy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics. 5:1979;287-326.
8. Gonzalez T., Sahni S. Preemptive scheduling of uniform processor systems. Journal of the ACM. 25:1978;92-101.
9. K.S. Hong, J.Y.-T. Leung, On-line scheduling of real-time tasks, IEEE Transactions on Computers 41 (10) (1992) 1326-1331.
10. W. Kubiak, J. B l ażewicz, P. Formanowicz, J. Breit, G. Schmidt, Flow shops with limited machine availability, submitted for publication, 1997.
11. J. Labetoulle, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, Preemptive scheduling of uniform machines subject to release dates, in: W.R. Pulleyblank (Ed.), Progress in Combinatorial Optimization, Academic Press, New York, 1984, pp. 245-261.
12. Lawler E.L., Labetoulle J. Preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM. 25:1978;612-619.
13. C.-Y. Lee, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, reaserch report, Department of Industrial and Systems Engineering, University of Florida, 1995.
14. C.L. Liu, Introduction to Combinatorial Mathematics, McGraw-Hill, New York, 1968.
15. Liu Z., Sanlaville E. Preemptive scheduling with variable profile, precedence constraints and due dates. Discrete Applied Mathematics. 58:1995;253-280.
16. Muntz R., Coffman E.G. Preemptive scheduling of real-time tasks on multiprocessor systems. Journal of the ACM. 17:1970;324-338.
17. Sanlaville E., Schmidt G. Machine scheduling with availability constraints. Acta Informatica. 35:1998;795-811.
18. Schmidt G. Scheduling on semi-identical processors. Zeitschrift für Operations Research A. 28:1984;153-162.
19. Ullman J.D. NP-complete scheduling problems. Journal of Computer System Sciences. 10:1975;384-393.
20. Vizing V.G. Minimization of the maximum delay in servicing systems with interruption. USSR Computational Mathematics and Mathematical Physics. 22(3):1982;227-233.