A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
We consider the two-machine flow-shop serial-batching scheduling problem where the machines have a limited capacity in terms of the number of jobs. Two criteria are considered here. The first criterion is the number of batches to be minimized. This criterion reflects situations where processing of any batch induces a fixed cost, which leads to a total cost proportional to the number of batches. The second criterion is the makespan. This model is relevant in different production contexts, especially when considering joint production and inbound delivery scheduling. We study the complexity of the problem and propose two polynomial-time approximation algorithms with a guaranteed performance. The effectiveness of these algorithms is evaluated using numerical experiments. Exact polynomial-time algorithms are also provided for some particular cases.
KeywordsTwo-machine flow-shop Serial batching Bounded batch size Makespan Batching cost
- Cheng, T., & Kovalyov, M. (2001). Single machine batch scheduling with sequential processing. IIE Transactions, 13, 413–420.Google Scholar
- Coffman, E. G., & Csirik, J. (2007). Performance guarantees for one-dimensional bin packing. In T. F. Gonzalez (Ed.), Handbook of approximation algorithms and metaheuristics (pp. 32-1–32-18). Boca Raton: Chappman and Hall.Google Scholar
- Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W.H. Freeman. Google Scholar
- Graham, R., Lawler, E., Lenstra, J., & Rinnooy Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. In E. J. PL Hammer & B. Korte (Eds.), Discrete optimization II, annals of discrete mathematics (Vol. 5, pp. 287–326). North-Holland: Elsevier.Google Scholar
- Merdan, M., Moser, T., Wahyudin, D., Biffl, S. (2008). Performance evaluation of workflow scheduling strategies considering transportation times and conveyor failures. Proceedings of IEEE International Conference on Industrial Engineering and, Engineering Management (pp. 389–394).Google Scholar