A heuristic for the two-machine open-shop scheduling problem with transportation times

Discrete Applied Mathematics

Volumn 93, Issue 2-3, 1999, Pages 287-304

  Strusevich, V A ^a  

^a UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Approximation; Open shop; Transportation time; Worst case analysis

Indexed keywords

EID: 0043099685     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00115-8     Document Type: Article

References (15)

1. M. Dell'Amico, Shop problems with two machines and time lags, Oper. Res. 44 (1996) 777-787.
2. M. Dell'Amico, R.J.M. Vaessens, Flow-and open-shop scheduling on two machines with transportation times and machine-independent processing times is NP-hard. Materiali di discussione 141, Dipartimento di Economia Politica, Università di Modena, Italy, 1995.
3. T. Gonzalez, S. Sahni, Open shop scheduling to minimize finish time, J. Assoc. Comput. Mach. 23 (1976) 665-679.
4. J.N.D. Gupta, V.A. Strusevich, C.M. Zwaneveld, Two-stage no-wait scheduling models with setup and removal times separated, Comput. Oper. Res. 24 (1997) 1025-1031.
5. 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.
6. L.G. Mitten, Sequencing n jobs in two machines with arbitrary time lags, Management Sci. 5 (1959) 293-298.
7. V.J. Rayward-Smith, D. Rebaine, Open-shop scheduling with delays, Theoret. Inform. Appl. (1992) 439-448.
8. D. Rebaine, V.A. Strusevich, Two-machine open shop scheduling with special transportation times, CASSM R&D Paper 15, 1998, University of Greenwich, London, UK.
9. V.A. Strusevich, Two-machine open-shop scheduling problem with setup, processing and removal times separated, Comput. Oper. Res. 20 (1993) 597-611.
10. V.A. Strusevich, L.A. Hall, An open-shop scheduling problem with a non-bottleneck machine, Oper. Res. Lett. 21 (1997) 11-18.
11. V.A. Strusevich, C.M. Zwaneveld, On non-permutation solutions to some two-machine flow shop scheduling models, Z. Oper. Res. 39 (1994) 305-319.
12. D.R. Sule, Sequencing n jobs on two machines with setup, processing and removal times separated, Naval Res. Logist. Quart. 29 (1982) 517-519.
13. W. Szwarc, Flow-shop problems with time lags, Management Sci. 29 (1983) 447-491.
14. V.S. Tanaev, Y.N. Sotskov, V.A. Strusevich, Scheduling Theory. Multi-Stage Systems, Kluwer, Dordrecht, 1994.
15. D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast'janov, D.B. Shmoys, Short shop schedules, Oper. Res. 45 (1997) 288-294.