Abstract
The paper is concerned with the two-machine scheduling problem where each job is to be processed on the first-stage machine and after that on the second-stage machine. In order to be processed, each job requires storage space that it seizes at the start of its processing on the first-stage machine and releases only at the completion of processing on the second-stage machine. The storage space is limited and its consumption varies from job to job. The goal is to minimise the time needed for the completion of all jobs. All instances of the considered scheduling problem are classified by means of five parameters. This leads to the sixty four families of instances. For each family, the paper establishes its computational complexity and, in the case of polynomial-time solvability, presents a polynomial-time algorithm, constructing an optimal schedule.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berlińska J (2020) Heuristics for scheduling data gathering with limited base station memory. Ann Oper Res 285(1–2):149–159
Blazewicz J, Lenstra JK, Rinnooy Kan AHG (1983) Scheduling subject to resource constraints: classification and complexity. Discret Appl Math 5(1):11–24
Brucker P (2007) Scheduling algorithms. Springer, Berlin
Brucker P, Knust S (2012) Complex scheduling. GOR-Publications. Springer, Berlin Heidelberg
Emmons H, Vairaktarakis G (2013) Flow shop scheduling: theoretical results, algorithms, and applications. Springer, New York
Fung J, Singh G, Zinder Y (2015) Capacity planning in supply chains of mineral resources. Inform Sci 316:397–418
Fung J, Zinder Y (2016) Permutation schedules for a two-machine flow shop with storage. Oper Res Lett 44(2):153–157
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness. W. H Freeman, New York
Hanyu G, Kononov A, Memar J, Zinder Y (2018) Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J Discrete Algorithms 52–53:143–155
Hall P (1935) On representatives of subsets. J London Math Soc 10(1):26–30
Hulett H, Will TG, Woeginger GJ (2008) Multigraph realizations of degree sequences: maximization is easy, minimization is hard. Oper Res Lett 36(5):594–596
Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Naval Res Logist Q 1(1):61–68
Kononov A, Hong J-S, Kononova P, Lin F-C (2012) Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications. J Sched 15(4):487–497
Kononov A, Memar J, Zinder Y (2019) Flow shop with job-dependent buffer requirements—a polynomial-time algorithm and efficient heuristics. In: Michael K, Yury K, Panos P (eds) Mathematical optimization theory and operations research. Springer, Cham, pp 342–357
Kononov A, Sevastyanov S, Sviridenko M (2012) A complete 4-parametric complexity classification of short shop scheduling problems. J Sched 15(4):427–446
Kononova P, Kochetov Y (2013) The variable neighborhood search for the two machine flow shop problem with a passive prefetch. J Appl Ind Math 7(1):54–67
Le HT, Geser P, Middendorf M (2019) An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine. In: Arnaud L, Luís P (eds) Evolutionary computation in combinatorial optimization. Springer, Cham, pp 50–65
Lin F-C, Hong J-S, Lin BMT (2009) A two-machine flowshop problem with processing time-dependent buffer constraints—an application in multimedia presentations. Comput Oper Res 36(4):1158–1175
Min Y, Choi B-C, Park M-J (2019) Two-machine flow shops with an optimal permutation schedule under a storage constraint. J Sched 23:1–10
Pinedo M (2012) Scheduling theory, algorithms, and systems. Springer, New York
Witt A, Voss S (2007) Simple heuristics for scheduling with limited intermediate storage. Comput Oper Res 34(8):2293–2309
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zinder, Y., Kononov, A. & Fung, J. A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements. J Comb Optim 42, 276–309 (2021). https://doi.org/10.1007/s10878-021-00706-4
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-021-00706-4