Parallel machine scheduling with machine availability and eligibility constraints

European Journal of Operational Research

Volumn 184, Issue 2, 2008, Pages 458-467

  Liao, Lu Wen ^a   Sheen, Gwo Ji ^a  

^a INSTITUTE OF INDUSTRIAL MANAGEMENT   (Taiwan)

Author keywords

Availability constraint; Eligibility constraint; Network flows; Parallel machines; Scheduling

Indexed keywords

CONSTRAINT THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

AVAILABILITY CONSTRAINT; ELIGIBILITY CONSTRAINT; NETWORK FLOWS; PARALLEL MACHINES;

PARALLEL PROCESSING SYSTEMS;

EID: 34548502246     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.11.027     Document Type: Article

References (27)

1. Ahuja R.K., Magnanti R.K., and Orlin J.B. Network Flows: Theory, Algorithms, and Applications (1993), Prentice-Hall, New Jersey
2. Blazewicz J., Ecker K., Schmidt G., and Weglarz J. Scheduling in Computer and Manufacturing Systems (1993), Springer, Berlin
3. Blazewicz J., Drozdowski M., Formanowicz P., Kubiak W., and Schmidt G. Scheduling preemptable tasks on parallel processors with limited availability. Parallel Computing 26 (2000) 1195-1211
4. Blazewicz J., Ecker K., Pesch E., Schmidt G., and Weglarz J. Scheduling Computer and Manufacturing Processes. second ed. (2001), Springer, Berlin
5. Blazewicz J., Dell'Olmo P., Drozdowski M., and Maczka P. Scheduling multiprocessor tasks on parallel processors with limited availability. European Journal of Operational Research 149 (2003) 377-389
6. Centeno G., and Armacost R.L. Parallel machine scheduling with release time and machine eligibility restrictions. Computers & Industrial Engineering 33 1-2 (1997) 273-276
7. Centeno G., and Armacost R.L. Minimizing makespan on parallel machines with release time and machine eligibility restrictions. International Journal of Production Research 42 6 (2004) 1243-1256
8. Federgruen A., and Groenevelt H. Preemptive scheduling of uniform processors by ordinary network flow techniques. Management Science 32 (1986) 341-349
9. Graham R.L., Lawer E.L., Lenstra J.K., and Rinnooy Ken A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
10. Horn W.A. Some simple scheduling algorithms. Naval Research Logistics Quarterly 21 (1974) 177-185
11. Hwang H.C., and Chang S.Y. Parallel machines scheduling with machine shutdowns. Computers & Mathematics with Applications 36 3 (1998) 21-31
12. Kellerer H. Algorithm for multiprocessor scheduling with machine release time. IIE Transactions 30 (1998) 991-999
13. Lawer E.L. Combinational Optimization: Networks and Matroids (1976), Holt, Rinehart & Winston, New York
14. Labetoulle J., Lawler E.L., Lenstra J.K., and Rinnoy Kan A.H.G. Preemptive scheduling of uniform machines subject to release dates. In: Pulleyblank W.R. (Ed). Progress in Combinatorial Optimization (1984), Academic Press, New York 245-261
15. Lee C.Y. Parallel machines scheduling with nonsimultaneous machine available time. Discrete Applied Mathematics 30 (1991) 53-61
16. Lee C.Y. Machine scheduling with an availability constraint. Journal of Global Optimization 9 (1996) 395-416
17. Lee C.Y., Lei L., and Pinedo M. Current trends in deterministic scheduling. Annals of Operations Research 70 (1997) 1-41
18. Lee C.Y., He Y., and Tang G. A note on "parallel machine scheduling with non-simultaneous machine available time". Discrete Applied Mathematics 100 (2000) 133-135
19. Lin Y., and Li W. Parallel machine scheduling of machine-dependent jobs with unit-length. European Journal of Operational Research 156 (2004) 261-266
20. Liu Z., and Sanlaville E. Profile scheduling of list algorithm. In: Chretienne P., et al. (Ed). Scheduling Theory and its Applications (1995), Wiley, New York 1-110
21. Martel C. Scheduling uniform machines with release times, deadlines and due times. In: Dempster M.A.H., Lenstra J.K., and RinnooyKan A.H.G. (Eds). Deterministic and Stochastic Scheduling (1982), Reidel, Dordrechr 88-99
22. Pinedo M. Scheduling: Theory, Algorithm and System. second ed. (2002), Prentice Hall, New Jersey
23. Sanlaville E. Nearly on line scheduling of preemptive independent tasks. Discrete Applied Mathematics 57 (1995) 229-241
24. Sanlaville E., and Schmidt G. Machine scheduling with availability constraints. Acta Informatica 35 (1998) 795-811
25. Schmidt G. Scheduling on semi-identical processors. Zeitschrift f für Operations Research A28 (1984) 153-162
26. Schmidt G. Scheduling independent tasks with deadlines on semi-identical processors. Journal of the Operational Research Society 39 (1988) 271-277
27. Schmidt G. Scheduling with limited machine availability. European Journal of Operational Research 121 (2000) 1-15