Scheduling and lot streaming in two-machine open shops with no-wait in process

Naval Research Logistics

Volumn 52, Issue 3, 2005, Pages 261-275

  Hall, Nicholas G ^a   Laporte, Gilbert ^b   Selvarajah, Esaignani ^c   Sriskandarajah, Chelliah ^d  

^a OHIO STATE UNIVERSITY   (United States)

^b HEC MONTRÉAL   (Canada)

^c MCMASTER UNIVERSITY   (Canada)

^d UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Generalized traveling salesman problem; Lot streaming and batching; Machine scheduling; No wait open shops

Indexed keywords

GENERALIZED TRAVELING SALESMAN PROBLEM; LOT STREAMING AND BATCHING; MACHINE SCHEDULING; NO-WAIT OPEN SHOPS;

ALGORITHMS; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; NUMERICAL METHODS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING; TRAVELING SALESMAN PROBLEM;

PROCESS CONTROL;

EID: 17444386020     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.20065     Document Type: Article

References (24)

1. I.N.K. Abadi, N.G. Hall, and C. Sriskandarajah, Minimizing cycle time in a blocking flowshop, Oper Res 48 (2000), 177-180.
2. K.R. Baker, Introduction to sequencing and scheduling, Addison-Wesley, Reading, MA, 1974.
3. K.R. Baker, Solution procedures for the lot-streaming problem, Decision Sci 21 (1990), 475-491.
4. K.R. Baker, Lot streaming in the two machine flow shop with setup times, Working Paper No. 297, Amos Tuck School of Business Administration, Dartmouth College, Hanover, NH, 1993.
5. G. Carpaneto, and P. Toth, Some new branching and bounding criteria for the asymmetric traveling salesman problem, Management Sci 26 (1980), 736-743.
6. M. R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-Completeness, Freeman, San Francisco, 1979.
7. M. Gendreau, G. Laporte, and D. Simchi-Levi, A degree relaxation algorithm for the asymmetric generalized traveling salesman problem. Publication CRT-800, Centre for Research on Transportation, Montreal, 1991.
8. P.C. Gilmore and R.E. Gomory, Sequencing a one-state variable machine: A solvable case of the travelling salesman problem, Oper Res 12 (1964), 665-679.
9. F. Glover and M. Laguna, Tabu search, Kluwer, Boston, 1997.
10. S.K. Goyal and C. Sriskandarajah, No-wait shop scheduling: Computational complexity and approximate algorithms, Opsearch 25 (1988), 220-244.
11. 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.
12. N.G. Hall, G. Laporte, E. Selvarajah, and C. Sriskandarajah, Scheduling and lot streaming in flowshops with no-wait in process, J Sched 6 (2003), 339-354.
13. N.G. Hall and C. Sriskandarajah, A survey of machine scheduling problems with blocking and no-wait in process, Oper Res 44 (1996), 510-525.
14. J.H. Holland, Adaptation in natural and artificial systems, University of Michigan Press, Ann Arbor, MI, 1975.
15. R.M. Karp, A patching algorithm for the nonsymmetric traveling-salesman problem, SIAM J Comput 8 (1979), 561-573.
16. W. Kubiak, C. Sriskandarajah, and K. Zaras, A note on the complexity of openshop scheduling problems, INFOR 29 (1991), 284-294.
17. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, Handb Oper Res Management Sci 4 (1993), 445-552.
18. C.E. Noon and J.C. Bean, An efficient transformation of the generalized traveling salesman problem, INFOR 31 (1993), 39-44.
19. M. Pinedo, Scheduling: Theory, algorithms, and systems, Prentice-Hall, Englewood Cliffs, NJ, 1995.
20. C.N. Potts and K.R. Baker, Flowshop scheduling with lot streaming, Oper Res Lett 8 (1989), 297-303.
21. C.N. Potts and L.N. Van Wassenhove, Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity, J Oper Res Soc 43 (1992), 395-406.
22. S. Sahni and Y. Cho, Complexity of scheduling shops with no-wait in process, Math Oper Res 4 (1979), 448-457.
23. P. Tadayon, Thermal challenges during microprocessor testing, Intel Technol J, 3rd quarter, (2000), 1-8.
24. D. Trietsch and K.R. Baker, Basic techniques for lot streaming, Oper Res 41 (1993), 1065-1076.