Scheduling and lot streaming in flowshops with no-wait in process

Journal of Scheduling

Volumn 6, Issue 4, 2003, Pages 339-354

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

^a OHIO STATE UNIVERSITY   (United States)

^b GERAD   (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 flowshops

Indexed keywords

DYNAMIC PROGRAMMING ALGORITHMS; MACHINE SCHEDULING; NO-WAIT FLOWSHOPS; WORK-IN-PROCESS INVENTORY;

DYNAMIC PROGRAMMING; HEURISTIC METHODS; LINEAR PROGRAMMING; PRODUCTION; TRAVELING SALESMAN PROBLEM;

SCHEDULING;

EID: 3543079267     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024042209719     Document Type: Article

References (27)

1. Abadi, I. N. K., N. G. Hall, and C. Sriskandarajah, "Minimizing cycle time in a blocking flowshop," Oper. Res., 48, 177-180 (2000).
2. Baker, K. R., Introduction to Sequencing and Scheduling, Addison-Wesley, Reading, MA, 1974.
3. Baker, K. R., "Solution procedures for the lot-streaming problem," Decision Sci., 21, 475-491 (1990).
4. Baker, K. R., "Lot streaming in the two machine flow shop with setup times," Ann. Oper. Res., 57, 1-11 (1995).
5. Carpaneto, G. and P. Toth, "Some new branching and bounding criteria for the asymmetric traveling salesman problem," Manage. Sci., 26, 736-743 (1980).
6. Gendreau, M., and G. Laporte, D. Simchi-Levi, "A degree relaxation algorithm for the asymmetric generalized traveling salesman problem," Publication CRT-800, Centre for Research on Transportation, Montreal, 1991.
7. Gilmore, P. C. and R. E. Gomory, "Sequencing a one-state variable machine: A solvable case of the travelling salesman problem," Oper. Res., 12, 665-679 (1964).
8. Glass, C. A., J. N. D. Gupta, C. N. Potts, "Lot streaming in three-stage process," Eur. J. Oper. Res., 75, 378-394 (1994).
9. Glover, F. and M. Laguna, Tabu Search, Kluwer, Boston, 1997.
10. Gonzalez, T. and S. Sahni, "Openshop scheduling to minimize finish time," J. Assoc. Comput. Mach., 23, 665-679 (1976).
11. Goyal, S. K. and C. Sriskandarajah, "No-wait shop scheduling: Computational complexity and approximate algorithms," Opsearch, 25, 220-244 (1988).
12. Hall, N. G., G. Laporte, E. Selvarajah, C. Sriskandarajah, "Scheduling and lot streaming in openshops with no-wait in process," Working Paper, Fisher College of Business, The Ohio State University, Columbus, Ohio, submitted for publication, December, 2002.
13. Hall, N. G. and C. Sriskandarajah, "A survey of machine scheduling problems with blocking and no-wait in process," Oper. Res., 44, 510-525 (1996).
14. Hsu, E. and M. Stein, "Anodize load scheduling for diamond aluminum," Undergraduate Thesis, Department of Industrial Engineering, University of Toronto, Canada, 1991.
15. Karp, R. M., "A patching algorithm for the nonsymmetric traveling-salesman problem," SIAM J. Comput., 8, 561-573 (1979).
16. Kumar, S., T. P. Bagchi, C. Sriskandarajah, "Lot streaming and scheduling heuristics for m-machine no-wait flowshops," Comput. Indust. Eng., 38, 149-172 (2000).
17. Lawler, E. L., J. K. Lenstra, and A. H. G. Rinnooy Kan, D. B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester, UK, 1985.
18. Monma, C. L. and A. H. G. Rinnooy Kan, "A concise survey of efficiently solvable special cases of the permutation flow-shop problem," RAIRO Recherche Operationelle, 17, 105-119 (1983).
19. Noon, C. E. and J. C. Bean, "A Lagrangian based approach for the asymmetric generalized traveling salesman problem," Oper. Res., 39, 623-632 (1991).
20. Noon, C. E. and J. C. Bean, "An efficient transformation of the generalized traveling salesman problem," INFOR, 31, 39-44 (1993).
21. Pinedo, M., Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995.
22. Potts, C. N. and K. R. Baker, "Flowshop scheduling with lot streaming," Oper. Res. Lett., 8, 297-303 (1989).
23. Potts, C. N. and L. N. Van Wassenhove, "Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity," J. Oper. Res. Soc., 43, 395-406 (1992).
24. Röck, H., "The three machine no-wait flowshop problem is NP-complete," J. Assoc. Comput. Mach., 31, 336-345 (1984).
25. Sriskandarajah, C. and E. Wagneur, "Lot streaming and scheduling multiple products in two-machine no-wait flowshops," IIE Trans., 31, 695-707 (1999).
26. Trietsch, D. and K. R. Baker, "Basic techniques for lot streaming," Oper. Res., 41, 1065-1076 (1993).
27. Vickson, R. O., "Optimal lot streaming for multiple products in a two-machine flowshop," Eur. J. Oper. Res., 85, 556-575 (1995).