Two-machine flowshop batching and scheduling

Annals of Operations Research

Volumn 133, Issue 1-4, 2005, Pages 149-161

  Lin, B M T ^a   Cheng, T C E ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Batch processing; Flowshop; Heuristics; Lower bound; Makespan; Production scheduling; Strong NP hardness

Indexed keywords

EID: 15244361359     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-004-5029-7     Document Type: Conference Paper

References (15)

1. Ahmadi, J.H., R.H. Ahmadi, S. Dasu, and C.S. Tang. (1992). "Batching and Scheduling on Batch and Discrete Processors." Operations Research 40, 750-763.
2. Albers, A. and P. Brucker. (1993). "The Complexity of One-Machine Batching Problem." Discrete Applied Mathatmematics 47, 87-107.
3. Allahverdi, A., J.N.D. Gupta, and T. Aldowaisan. (1999). "A Review of Scheduling Research Involving Setup Considerations." Omega 27, 219-239.
4. Cheng, T.C.E., Z.-L. Chen, M.Y. Kovalyov, and B.M.T. Lin. (1996). "Parallel-Machine Batching and Scheduling to Minimize Total Completion Time." HE Transactions 28, 953-956.
5. Cheng, T.C.E., J.N.D. Gupta, and G. Wang. (2000). "A Review of Flowshop Scheduling Research with Setup Times." Production and Operations Management 9, 262-282.
6. Cheng, T.C.E., M.Y. Kovalyov, and B.M.T. Lin. (1997). "Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties." SIAM Journal on Optimization 7, 547-559.
7. Cheng, T.C.E., B.M.T. Lin, and A. Toker. (2000). "Makespan Minimization in the Two-Machine Flowshop Batch Scheduling Problem." Naval Research Logistics 47, 128-144.
8. Cheng, T.C.E. and G. Wang. (1998). "Batching and Scheduling to Minimize the Makespan in the Two-Machine Flowshop." IIE Transactions 30, 447-453.
9. Coffmann, E.G., A. Nozari, and M. Yannakakis. (1989). "Optimal Scheduling of Products with Two Sub-assemblies on a Single Machine." Operations Research 37, 426-436.
10. Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman.
11. Glass, C.A., C.N. Potts, and A.V. Strusevich. (2001). "Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops." INFORMS Journal on Computing 13, 120-137.
12. Johnson, S.M. (1954). "Optimal Two- and Three-Stage Production Schedules with Setup Times Included." Naval Research Logistics Quarterly 1, 61-67.
13. Lin, B.M.T. and J.M. Wu. (2002). "A New Lower Bound Scheme for the Two-Machine Flowshop Scheduling to Minimize the Total Completion Time." In Electronic Proceedings of the Fourth Asia-Pacific Conference on Industrial Engineering and Management Systems, Taipei, Taiwan, December 2002.
14. Naddef, D. and C. Santos. (1988). "One-Pass Batching Algorithms for the One-Machine Problem." Discrete Applied Matthematics 21, 133-146.
15. Potts, C.N. and M.K. Kovalyov. (2000). "Scheduling with Batching: A Review." European Journal of Operational Research 102, 228-249.