Abstract
We study the problem of batching and scheduling n jobs in a flow shop comprising m, m≥2, machines. Each job has to be processed on machines 1,…,m in this order. Batches are formed on each machine. A machine dependent setup time precedes the processing of each batch. Jobs of the same batch are processed on each machine sequentially so that the processing time of a batch is equal to the sum of the processing times of the jobs contained in it. Jobs of the same batch formed on machine l become available for a downstream operation on machine l+1 at the same time when the processing of the last job of the batch on machine l has been finished. The objective is to minimize maximum job completion time. We establish several properties of an optimal schedule and develop polynomial time algorithms for important special cases. They are improvements over the existing methods with regard to their generality and time efficiency.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bukchin, J., & Masin, M. (2004). Multi-objective lot splitting for a single product m-machine flow shop line. IIE Transactions, 36, 191–202.
Bukchin, J., Tzur, M., & Jaffe, M. (2002). Lot splitting to minimize average flow-time in a two machine flow shop. IIE Transactions, 34, 953–970.
Cheng, T. C. E., Lin, B. M. T., & Toker, A. (2000). Makespan minimization in the two-machine flowshop batch scheduling problem. Naval Research Logistics, 47, 128–144.
Chin, H. N., & Chang, J. H. (2005, to appear). Cost models for lot streaming in a multistage flow shop, Omega.
Glass, C. A., Potts, C. N., & Strusevich, V. A. (2001). Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS Journal on Computing, 13, 120–137.
Huq, F., Cutright, K., & Martin, C. (2004). Employee scheduling and makespan minimization in a flow shop with multiprocessor work stations: a case study. Omega, 32, 121–129.
Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61–68.
Kalir, A. A., & Sarin, S. C. (2000). Evaluation of potential benefits of lot streaming in flow shop systems. International Journal of Production Economics, 66, 131–142.
Li, C.-L., & Xiao, W.-Q. (2004). Lot streaming with supplier-manufacturer coordination. Naval Research Logistics, 51, 522–542.
Mosheiov, G., & Oron, D. (2004). A note on flow-shop and job-shop batch scheduling with identical processing-time jobs. European Journal of Operational Research, 161, 285–291.
Mosheiov, G., Oron, D., & Ritov, Y. (2004). Flow-shop batch scheduling with identical processing-time jobs. Naval Research Logistics, 51, 783–799.
Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120, 228–249.
Potts, C. N., & Van Wassenhove, L. N. (1992). Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. Journal of the Operational Research Society, 43, 395–406.
Tanaev, V. S., Kovalyov, M. Y., & Shafransky, Y. M. (1998). Scheduling theory. Group technologies. Minsk: IEC NASB (in Russian).
Tanaev, V. S., Gordon, V. S., & Shafransky, Y. M. (1994). Scheduling theory. One-stage systems. Dordrect: Kluwer Academic.
Tanaev, V. S., Sotskov, Y. N., & Strusevich, V. A. (1995). Scheduling theory. Multi-stage systems. Dordrecht: Kluwer Academic.
Trietsch, D., & Baker, K. R. (1993). Basic techniques for lot streaming. Operations Research, 41, 1065–1076.
Webster, S., & Baker, K. R. (1995). Scheduling groups of jobs on a single machine. Operations Research, 43, 692–703.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ng, C.T., Kovalyov, M.Y. Batching and scheduling in a multi-machine flow shop. J Sched 10, 353–364 (2007). https://doi.org/10.1007/s10951-007-0041-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-007-0041-9