Scheduling in an assembly-type production chain with batch transfer

Omega

Volumn 35, Issue 2, 2007, Pages 143-151

  Lin, B M T ^a   Cheng, T C E ^b   Chou, A S C ^c  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c MING CHUAN UNIVERSITY   (Taiwan)

Author keywords

Batch scheduling; Heuristics; Makespan; NP hardness; Two stage flowshop

Indexed keywords

ASSEMBLY; HARDNESS; JOB SHOP SCHEDULING; POLYNOMIAL APPROXIMATION; SCHEDULING ALGORITHMS; SUPPLY CHAIN MANAGEMENT;

BATCH TRANSFER; BATCH-SCHEDULING; COMPONENT PART; FLOW-SHOPS; HEURISTIC; MACHINE ASSEMBLY; MAKESPAN; NP-HARDNESS; PRODUCTION CHAIN; TWO-STAGE FLOWSHOP;

HEURISTIC ALGORITHMS;

EID: 33748265082     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2005.04.004     Document Type: Article

References (24)

1. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-67
2. Pinedo M. Scheduling theory, algorithms, and systems (2001), Prentice Hall, Englewood Cliffs, NJ
3. Reisman A., Kumar A., and Motwani J. Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994. IEEE Transactions on Engineering Management 44 (1997) 316-329
4. Lee C.Y., Cheng T.C.E., and Lin B.M.T. Minimizing makespan in the 3-machine assembly-type flowshop scheduling problem. Management Science 39 (1993) 616-625
5. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and job shop scheduling. Mathematics of Operations Research 1 (1976) 117-129
6. Bhatnagar R., Chandra P., and Goyal S.K. Models for multi-plant coordination. European Journal of Operational Research 67 (1993) 141-160
7. Sun X., Morizawa K., and Nagasawa H. Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling. European Journal of Operational Research 146 (2003) 498-516
8. Potts C.N., and van Wassenhove L.N. Integrating scheduling with batching and lot-sizing a review of algorithms and complexity. Journal of the Operational Research Society 43 (1992) 95-406
9. Webster S., and Baker K.R. Scheduling groups of jobs on a single machine. Operations Research 43 (1995) 692-703
10. Allahverdi T., Gupta J.N.D., and Aldowaisan T. A review of scheduling research involving setup considerations. Omega 27 (1999) 219-239
11. Cheng T.C.E., Gupta J.N.D., and Wang G. A review of flowshop scheduling research with setup times. Production and Operations Management 9 (2000) 262-282
12. Potts C.N., and Kovalyov M.K. Scheduling with batching: a review. European Journal of Operational Research 102 (2000) 228-249
13. Lee C.Y., Uzsoy R., and Martin-Vega L.A. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research 40 (1992) 764-775
14. Ahmadi J.H., Ahmadi R.H., Dasu S., and Tang C.S. Batching and scheduling jobs on batch and discrete processors. Operations Research 39 (1992) 750-763
15. Albers S., and Brucker P. The complexity of one-machine batching problems. Discrete Applied Mathematics 47 (1993) 87-107
16. Coffman Jr. E.G., Yannakakis M., Magazine M.J., and Santos C. Batch sizing and job sequencing on a single machine. Annals of Operations Research 26 (1990) 135-147
17. Santos C.A., and Magazine M.J. Batching in single operation manufacturing systems. Operations Research Letters 4 (1985) 99-103
18. Cheng T.C.E., and Wang Q. Batching and scheduling to minimize the makespan in the two-machine flowshop. IIE Transactions 30 (1998) 447-453
19. Cheng T.C.E., Lin B.M.T., and Toker A. Makespan minimization in the two-machine flowshop batch scheduling problem. Naval Research Logistics 47 (2001) 128-144
20. Glass C.A., Potts C.N., and Strusevich V.A. Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing 13 (2001) 120-137
21. Kovalyov M.Y., Potts C.N., and Strusevich V.A. Batching decisions for assembly production systems. European Journal of Operational Research 157 (2004) 620-642
22. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Smoys D.B. Sequencing and scheduling: algorithms and complexity. In: Graves S.C., Rinnoy Kan A.H.G., and Zipkin P. (Eds). Handbooks of operations research and management science, Volume 4: logistics of production and inventory (1993), North Holland, Amsterdam 445-522
23. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), Freeman, New York
24. Li C.-L., and Xiao W.-Q. Lot streaming with supplier-manufacturer coordination. Naval Research Logistics 51 (2004) 467-631