Scheduling for Parallel Dedicated Machines with a Single Server

Naval Research Logistics

Volumn 47, Issue 4, 2000, Pages 304-328

  Glass, Celia A ^a   Shafransky, Yakov M ^b   Strusevich, Vitaly A ^c  

^a CITY UNIVERSITY   (United Kingdom)

^b UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^c UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Approximation; Complexity; Parallel dedicated machines; Scheduling; Single server

Indexed keywords

EID: 0013239064     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1     Document Type: Article

References (20)

1. K.R. Baker, Scheduling groups of jobs in the two-machine flow shop, Math Comput Model 13 (1990), 29-36.
2. J. Blazewicz, P. Dell'Olmo, and M. Drozdowski, Scheduling of server-client applications, Int Trans Oper Res 6 (1999), 345-363.
3. J. Blazewicz, J.K. Lenstra, and A.H.G. Rinnooy Kan, Scheduling subject to resource constraints, Discrete Appl Math 5 (1983), 11-24.
4. T.C.E. Cheng, G. Wang, and C. Sriskandarajah, One-operator two-machine flow-shop scheduling with setup and dismounting times. Comput Oper Res 26 (1999), 715-730.
5. M.R. Garey and D.S. Johnson, Computers and intractability. A guide to the theory of N P-completeness, Freeman, San Francisco, 1979.
6. M.R. Garey, D.S. Johnson, and R. Sethi, The complexity of flowshop and jobshop scheduling, Math Oper Res 1 (1976), 117-129.
7. P.C. Gilmore and R.E. Gomory, Sequencing a one-state variable machine: A solvable case of the traveling salesman problem, Oper Res 12 (1964), 655-679.
8. P.C. Gilmore, E.L. Lawler, and D.B. Shmoys, "Well solved special cases," in The traveling salesman problem. A guided tour of combinatorial optimization, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Editors), Wiley, New York, 1986, pp. 87-143.
9. T. Gonzalez and S. Sahni, Open shop schedules to minimize finish time, J Assoc Comput Mach 23 (1976), 665-679.
10. J.N.D. Gupta, V.A. Strusevich, and C.M. Zwaneveld, Two-stage no-wait scheduling models with setup and removal times separated, Comput Oper Res 24 (1997), 1025-1031.
11. N.G. Hall, C.N. Potts, and C. Sriskandarajah, Parallel machine scheduling with a common server, Working Paper Series WP 94-21, Max M. Fisher College of Business, The Ohio State University, Columbus, OH, 1994.
12. S.M. Johnson, Optimal two- and three-stage production schedules with setup times included, Nav Res Logistics Quart 1 (1954), 61-68.
13. W. Kubiak, C. Sriskandarajah, and K. Zaras, A note on the complexity of open-shop scheduling problems, INFOR 29 (1991), 284-294.
14. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, "Sequencing and scheduling: Algorithms and complexity," in Handbooks in operations research and management science, Vol. 4, Logistics of production and inventory, S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin (Editors), North-Holland, Amsterdam, 1993, pp. 455-522.
15. R. Logendran and C. Sriskandarajah, Two-machine group scheduling problem with blocking and anticipatory setups, Eur J Oper Res 69 (1993), 467-481.
16. I.N. Lushchakova and V.A. Strusevich, Two-stage systems with nonfixed routes and resource constraints, Zh Vychisl Mat Mat Fiz 29 (1989), 1393-1407 (in Russian).
17. H. Röck, The three-machine no-wait flow-shop problem is N P-complete, J Assoc Comput Mach 31 (1984), 336-345.
18. S. Sahni and Y. Cho, Complexity of scheduling shop with no wait in process, Math Oper Res 4 (1979), 448-457.
19. V.A. Strusevich, Two-machine open shop scheduling problem with setup, processing and removal times separated, Comput Oper Res 20 (1993), 597-611.
20. T. Yoshida and K. Hitomi, Optimal two-stage production scheduling with setup times separated, AIIE Trans 11 (1979), 261-263.