Two-Machine No-Wait Flow Shop Scheduling with Missing Operations

References

• Dell'Olmo P. , Kellerer H. , Speranza M. G. , Tuza Zs. A 13/12 approximation algorithm for bin packing with extendable bins. Inform. Process. Lett. (1998) 65 229 233 Crossref, Google Scholar
• Dell'Olmo P. , Speranza M. G. Approximation algorithms for partitioning small items in unequal bins to minimize the total size. Ann. Oper. Res. (1999) . To appear in Google Scholar
• Gilmore P. C. , Gomory R. E. Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Oper. Res. (1964) 12 655 679 Link, Google Scholar
• Gilmore P. C. , Lawler E. L. , Shmoys D. B. , Lawler E. L. , Lenstra J. K. , Rinnooy Kan A. H. G. , Shmoys D. B. Well-Solved special cases. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (Wiley, Chichester) 87 143 Google Scholar
• Glass C. A. , Gupta J. N. D. , Potts C. N. Two-machine flow shop scheduling with missing operations: Special cases and approximation algorithms. (1995) (Faculty of Mathematical Studies, University of Southampton, U.K.) . Preprint OR75 (revision) Google Scholar
• Hall N. G. , Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. (1996) 44 510 525 Link, Google Scholar
• Johnson S. M. Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Quart. (1954) 1 61 68 Crossref, Google Scholar
• Karimi I. A. Personal communication. (1992) Google Scholar
• Reklaitis G. V. , Mah R. S. H. , Reklaitis G. V. Review of scheduling of process operations. Selected Topics on Computer-Aided Process Design and Analysis (1982) (American Institute of Chemical Engineers, New York) 119 133 Google Scholar
• Sahni S. , Cho Y. Complexity of scheduling shops with no wait in process. Math. Oper. Res. (1979) 4 448 457 Link, Google Scholar
• Speranza M. G. , Tuza Zs. On-line approximation algorithms for scheduling tasks on identical machines with extendable working time. Ann. Oper. Res. (1999) 86 491 506 . To appear in Crossref, Google Scholar