Scheduling problems for parallel dedicated machines under multiple resource constraints

Discrete Applied Mathematics

Volumn 133, Issue 1-3, 2003, Pages 45-68

  Kellerer, H ^a   Strusevich, V A ^b  

^a UNIVERSITY OF GRAZ   (Austria)

^b UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Approximation; Complexity; Parallel dedicated machines; Resource constraints; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

RESOURCE CONSTRAINTS;

PARALLEL PROCESSING SYSTEMS;

EID: 0242366706     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00433-5     Document Type: Conference Paper

References (15)

1. Aksjonov V.A. A polynomial-time algorithm of approximate solution of a scheduling problem. Upravlyaemye Sistemy. 28:1988;8-11. (in Russian).
2. J. Blažewicz, W. Cellary, R. Slowiński, J. Wȩglarz, Scheduling under resource constraints, Ann. Oper. Res. 7 (1987).
3. Blažewicz J., Lenstra J.K., Rinnooy Kan A.H.G. Scheduling subject to resource constraints. Discrete Appl. Math. 5:1983;11-24.
4. Chen B., Strusevich V.A. Approximation algorithms for three machine open shop scheduling. ORSA J. Comput. 5:1993;321-326.
5. Garey M.R., Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
6. Glass C.A., Shafransky Y.M., Strusevich V.A. Scheduling for parallel dedicated machines with a single server. Naval Res. Logist. 47:2000;304-328.
7. Gonzalez T., Sahni S. Open shop scheduling to minimize finish time. J. Assoc. Comput. Mach. 23:1976;665-679.
8. Jurisch B., Kubiak W. Two-machine open shops with renewable resources. Oper. Res. 45:1997;544-552.
9. H. Kellerer, V.A. Strusevich, Scheduling parallel dedicated machines under a single non-shared resource, European J. Oper. Res., 174 (2003) 345-364.
10. Lawler E.L., Labetoulle J. On preemptive scheduling of unrelated parallel processors by linear programming. J. Assoc. Comput. Mach. 25:1978;612-619.
11. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Handbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 455-522.
12. Sevastianov S.V., Woeginger G.J. Makespan minimization in open shops. a polynomial time approximation scheme Math. Programming. 82:1998;191-198.
13. Shmoys D.B., Stein C., Wein J. Improved approximation algorithms for shop scheduling problems. SIAM J. Comput. 23:1994;617-632.
14. Strusevich V.A. Two-machine open shop scheduling problem with setup, processing and removal times separated. Comput. Oper. Res. 20:1993;597-611.
15. Williamson D.P., Hall L.A., Hoogeveen J.A., Hurkens C.A.J., Sevastianov S.V., Shmoys D.B. Short shop schedules. Oper. Res. 45:1997;288-294.