Abstract
We consider two versions of two-machine flow shop scheduling problems, where each job requires an additional resource from the start of its first operation till the end of its second operation. We refer to this resource as storage space. The storage requirement of each job is determined by the processing time of its first operation. The two problems differ from each other in the way resources are allocated for each job. In the first case, the job captures all the necessary units of storage space at the beginning of processing its first operation. In the second case, the job takes up storage space gradually as its first operation is performed. In both problems, the goal is to minimize the makespan. In our paper, we establish the exact borderline between the NP-hard and polynomial-time solvable instances of the problems with respect to the ratio between the storage size and the maximum operation length.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Availability of data and materials
Enquiries about data availability should be directed to the authors.
References
Berlińska J (2015) Scheduling for data gathering networks with data compression. Eur J Oper Res 246(3):744–749
Berlińska J (2020) Heuristics for scheduling data gathering with limited base station memory. Ann Oper Res 285(1):149–159
Blazewicz J, Lenstra JK, Kan AR (1983) Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5(1):11–24
Brucker P, Knust S (2012) Complex scheduling. Springer, Berlin
Brucker P, Heitmann S, Hurink J (2003) Flow-shop problems with intermediate buffers. OR Spectr 25(4):549–574
Emmons H, Vairaktarakis G (2013) Flow shop scheduling. Springer, Berlin
Fung J, Zinder Y (2016) Permutation schedules for a two-machine flow shop with storage. Oper Res Lett 44(2):153–157
Fung J, Singh G, Zinder Y (2015) Capacity planning in supply chains of mineral resources. Inf Sci 316:397–418
Garey M, Johnson D (1979) Computers and intractability. A guide to the theory of NP-completeness. A series of books in the mathematical sciences. W. H. Freeman and Co., San Francisco
Hong J-S, Chen B-S, Hung S-H, Hsiang J (2005) Toward an integrated digital museum system-the Chi Nan experiences. Int J Digit Libr 5(3):231–251
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 JS, Kononova P, Lin FC (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 (2022) On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements. J Global Optim 83:445–456. https://doi.org/10.1007/s10898-021-01097-w
Kononov A, Memar J, Zinder Y (2019) Flow shop with job-dependent buffer requirements—a polynomial-time algorithm and efficient heuristics. In: International conference on mathematical optimization theory and operations research, lecture notes in computer science, vol 11548, pp 342–357. Spinger. https://doi.org/10.1007/978-3-030-22629-9_24
Lin F-C, Hong J-S, Lin BMT (2008) A two-machine flow shop problem with processing time-dependent buffer constraints-an application in multimedia problem. Comput Oper Res 36(4):1158–1175
Lin F-C, Lai C-Y, Hong J-S (2008) Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries. Data Knowl Eng 66(3):384–401
Lin F-C, Lai C-Y, Hong J-S (2009) Heuristic algorithms for ordering media objects to reduce presentation lags in auto-assembled multimedia presentations from digital libraries. Electron Libr 27(1):134–148
Papadimitriou CH, Kanellakis PC (1980) Flowshop scheduling with limited temporary storage. J ACM 27(3):533–549
Pinedo ML (2016) Scheduling: theory, algorithms, and systems. Springer, Berlin
Acknowledgements
The research of the first author was carried out within the framework of the state contract of the Sobolev Institute of Mathematics (Project FWNF-2022-0019). The authors are grateful to the reviewers for their careful reading of the manuscript and their helpful remarks.
Funding
The funding was provided by the Sobolev Institute of Mathematics (Project FWNF-2022-0019).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors have not disclosed any competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Kononov, A., Pakulich, M. An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements. J Comb Optim 47, 45 (2024). https://doi.org/10.1007/s10878-024-01121-1
Accepted:
Published:
DOI: https://doi.org/10.1007/s10878-024-01121-1