A Heuristic for the Two-Machine No-Wait Openshop Scheduling Problem

Naval Research Logistics

Volumn 46, Issue 2, 1999, Pages 129-145

  Sidney, Jeffrey B ^a   Sriskandarajah, Chelliah ^b,c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

^c UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Deterministic scheduling; Flowshop; Heuristic algorithm; No wait scheduling; Openshop

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; SCHEDULING;

TWO-MACHINE NO-WAIT OPENSHOPS;

MACHINE SHOP PRACTICE;

EID: 0033101533     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199903)46:2<129::AID-NAV1>3.0.CO;2-3     Document Type: Article

References (11)

1. K.R. Baker, Introduction to sequencing and scheduling, Addison-Wesley, Reading, MA, 1974.
2. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, 1979.
3. P.C. Gilmore and R.E. Gomory, Sequencing a one state-variable machine: a solvable case of the traveling salesman problem, Operations Res 12 (1964), 655-679.
4. S.K. Goyal and C. Sriskandarajah, No-wait shop scheduling: Computational complexity and approximate algorithms, Opsearch 25 (1988), 220-244.
5. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Ann Discrete Math 5 (1979), 287-326.
6. N.G. Hall and C. Sriskandarajah, A survey of machine scheduling problems with blocking and no-wait in process, Operations Res 44 (1996), 510-525.
7. W. Kubiak, C. Sriskandarajah, and K. Zaras, A note on the complexity of openshop scheduling problems, INFOR 29(4) (1991), 284-294.
8. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, Report BS-R8909, Center for Mathematics and Computer Science, Amsterdam, The Netherlands, 1989.
9. M. Pinedo, Scheduling theory, algorithms, and systems, Prentice Hall, Englewood Cliffs, NJ, 1995.
10. H. Röck, The three machine no-wait flowshop problem is NP-complete, J Assoc Comput Machinery 31 (1984), 336-345.
11. S. Sahni and Y. Cho, Complexity of scheduling shops with no-wait in process, Math Operations Res 4 (1979), 448-457.