Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Allahverdi, A., Ng, C., Cheng, T., & Kovalyov, M. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985–1032.
Artigues, C., Billaut, J. C., & Esswein, C. (2005). Maximization of solution flexibility for robust shop scheduling. European Journal of Operational Research, 165(2), 314–328.
Brucker, P., Knust, S., Cheng, T., & Shakhlevich, N. (2004). Complexity results for flow-shop and open shop scheduling problems with transportation delays. Annals of Operations Research, 129, 81–106.
Chen, Z. L. (2010). Integrated production and outbound distribution scheduling: Review and extensions. Operations Research, 58, 130–148.
Chen, B., Glass, C. A., Potts, C. N., & Strusevich, V. A. (1996). A new heuristic for three-machine flow shop scheduling. Operations Research, 44, 891–898.
Cheng, T., & Kovalyov, M. (2001). Single machine batch scheduling with sequential processing. IIE Transactions, 13, 413–420.
Cheng, T., & Wang, G. (1998). Batching and scheduling to minimize the makespan in the two-machine flowshop. IIE Transactions, 30, 447–453.
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.
Esswein, C., Billaut, J. C., & Strusevich, V. (2005). Two machine shop scheduling: Compromise between flexibility and makespan value. European Journal of Operational Research, 167, 796–809.
Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W.H. Freeman.
Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117–129.
Glass, C., Potts, C., & Strusevich, V. (2001). Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing, 13(2), 120–137.
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.
Johnson, S. (1954). Optimal two- and three-stage production schedules with set-up times included. Naval Research Logistics Quarterly, 1, 61–68.
Lee, C. Y., & Chen, Z. L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4(1), 3–24.
Lee, C. Y., & Strusevich, V. A. (2005). Two-machine shop scheduling with an uncapacitated interstage transporter. IIE Transactions, 37(8), 725–736.
Lin, B., & Cheng, T. (2005). Two-machine flowshop batching and scheduling. Annals of Operations Research, 133, 149–161.
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).
Potts, C., & Kovalyov, M. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120, 228–249.
Tang, L., & Liu, P. (2009). Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration. Applied Mathematical Modelling, 33(2), 1187–1199.
Webster, S., & Baker, K. (1995). Scheduling groups of jobs on a single machine. Operations Research, 43(4), 692–703.
Yuan, J., Lin, Y., Cheng, T., & Ng, C. (2007). Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time. International Journal of Production Economics, 105(2), 402–406.
Acknowledgments
This work was partially sponsored by the French National Research Agency: Project ANR-09-BLAN-0361-02 (GUEPARD)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Aloulou, M.A., Bouzaiene, A., Dridi, N. et al. A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size. J Sched 17, 17–29 (2014). https://doi.org/10.1007/s10951-013-0340-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-013-0340-2