Batch scheduling on two-machine flowshop with machine-dependent setup times. (English) Zbl 1198.90167
Summary: We study a batch scheduling problem on a 2-machine flowshop. We assume unit processing time jobs, batch availability, and machine-dependent setup times. The objective is to find a job allocation to batches of integer size and a batch schedule that minimize makespan. We introduce a very efficient closed form solution for the problem.
MSC:
| 90B35 | Deterministic scheduling theory in operations research |
References:
| [1] | A. Allahverdi, C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov, “A survey of scheduling problems with setup times or costs,” European Journal of Operational Research, vol. 187, no. 3, pp. 985-1032, 2008. · Zbl 1137.90474 · doi:10.1016/j.ejor.2006.06.060 |
| [2] | T. C. E. Cheng, B. M. T. Lin, and A. Toker, “Makespan minimization in the two machine flowshop batch scheduling problem,” Naval Research Logistics, vol. 47, no. 2, pp. 128-144, 2000. · Zbl 0973.90031 · doi:10.1002/(SICI)1520-6750(200003)47:2<128::AID-NAV4>3.0.CO;2-# |
| [3] | C. A. Glass, C. N. Potts, and V. A. Strusevich, “Scheduling batches with sequential job processing for two machine flow and open shops,” INFORMS Journal on Computing, vol. 13, no. 2, pp. 120-137, 2001. · Zbl 1238.90064 |
| [4] | G. Mosheiov and D. Oron, “A note on flow-shop and job-shop batch scheduling with identical processing-time jobs,” European Journal of Operational Research, vol. 161, no. 1, pp. 285-291, 2005. · Zbl 1067.90049 · doi:10.1016/j.ejor.2003.09.010 |
| [5] | G. Mosheiov and D. Oron, “Open-shop batch scheduling with identical jobs,” European Journal of Operational Research, vol. 187, no. 3, pp. 1282-1292, 2008. · Zbl 1137.90511 · doi:10.1016/j.ejor.2006.03.068 |
| [6] | C. T. Ng and M. Y. Kovalyov, “Batching and scheduling in a multimachine flow shop,” Journal of Scheduling, vol. 10, no. 6, pp. 353-364, 2007. · Zbl 1153.90431 · doi:10.1007/s10951-007-0041-9 |
| [7] | G. Mosheiov, D. Oron, and Y. Ritov, “Flow-shop batch scheduling with identical processing time jobs,” Naval Research Logistics, vol. 51, no. 6, pp. 783-799, 2004. · Zbl 1075.90031 · doi:10.1002/nav.20028 |
| [8] | J. Chen and G. Steiner, “Approximation methods for discrete lot streaming in flow shops,” Operations Research Letters, vol. 21, no. 3, pp. 139-145, 1997. · Zbl 0888.90087 · doi:10.1016/S0167-6377(97)00039-4 |
| [9] | J. Chen and G. Steiner, “Discrete lot streaming in two-machine flow shops,” INFOR Journal, vol. 37, no. 2, pp. 160-173, 1999. |
| [10] | S. C. Liu, “A heuristic method for discrete lot-streaming with variable sublots in a flow-shop,” International Journal of Advanced Manufacturing Technology, vol. 22, no. 9-10, pp. 662-668, 2003. · doi:10.1007/s00170-002-1516-7 |
| [11] | R. G. Vickson, “Optimal lot streaming for multiple products in a two-machine flow shop,” European Journal of Operational Research, vol. 85, no. 3, pp. 556-575, 1995. · Zbl 0912.90183 · doi:10.1016/0377-2217(93)E0366-6 |
| [12] | J. K. Lenstra and A. H. G. Rinnooy Kan, “Computational complexity of discrete optimization problems,” Annals of Discrete Mathematics, vol. 4, pp. 121-140, 1979. · Zbl 0411.68042 · doi:10.1016/S0167-5060(08)70821-5 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
