{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:31Z","timestamp":1740122371762,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10878-024-01121-1","type":"journal-article","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T18:01:58Z","timestamp":1712253718000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6144-0251","authenticated-orcid":false,"given":"Alexander","family":"Kononov","sequence":"first","affiliation":[]},{"given":"Marina","family":"Pakulich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,4]]},"reference":[{"issue":"3","key":"1121_CR1","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/j.ejor.2015.05.026","volume":"246","author":"J Berli\u0144ska","year":"2015","unstructured":"Berli\u0144ska J (2015) Scheduling for data gathering networks with data compression. Eur J Oper Res 246(3):744\u2013749","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1121_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10479-019-03185-3","volume":"285","author":"J Berli\u0144ska","year":"2020","unstructured":"Berli\u0144ska J (2020) Heuristics for scheduling data gathering with limited base station memory. Ann Oper Res 285(1):149\u2013159","journal-title":"Ann Oper Res"},{"issue":"1","key":"1121_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz J, Lenstra JK, Kan AR (1983) Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5(1):11\u201324","journal-title":"Discrete Appl. Math."},{"key":"1121_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23929-8","volume-title":"Complex scheduling","author":"P Brucker","year":"2012","unstructured":"Brucker P, Knust S (2012) Complex scheduling. Springer, Berlin"},{"issue":"4","key":"1121_CR5","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s00291-003-0133-7","volume":"25","author":"P Brucker","year":"2003","unstructured":"Brucker P, Heitmann S, Hurink J (2003) Flow-shop problems with intermediate buffers. OR Spectr 25(4):549\u2013574","journal-title":"OR Spectr"},{"key":"1121_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5152-5","volume-title":"Flow shop scheduling","author":"H Emmons","year":"2013","unstructured":"Emmons H, Vairaktarakis G (2013) Flow shop scheduling. Springer, Berlin"},{"issue":"2","key":"1121_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.orl.2015.12.012","volume":"44","author":"J Fung","year":"2016","unstructured":"Fung J, Zinder Y (2016) Permutation schedules for a two-machine flow shop with storage. Oper Res Lett 44(2):153\u2013157","journal-title":"Oper Res Lett"},{"key":"1121_CR8","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ins.2014.11.015","volume":"316","author":"J Fung","year":"2015","unstructured":"Fung J, Singh G, Zinder Y (2015) Capacity planning in supply chains of mineral resources. Inf Sci 316:397\u2013418","journal-title":"Inf Sci"},{"key":"1121_CR9","unstructured":"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"},{"issue":"3","key":"1121_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00799-005-0116-1","volume":"5","author":"J-S Hong","year":"2005","unstructured":"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\u2013251","journal-title":"Int J Digit Libr"},{"issue":"1","key":"1121_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Naval Res. Logist. Q. 1(1):61\u201368","journal-title":"Naval Res. Logist. Q."},{"issue":"4","key":"1121_CR12","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10951-011-0235-z","volume":"15","author":"A Kononov","year":"2012","unstructured":"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\u2013497","journal-title":"J Sched"},{"key":"1121_CR13","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10898-021-01097-w","volume":"83","author":"A Kononov","year":"2022","unstructured":"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\u2013456. https:\/\/doi.org\/10.1007\/s10898-021-01097-w","journal-title":"J Global Optim"},{"key":"1121_CR14","doi-asserted-by":"publisher","unstructured":"Kononov A, Memar J, Zinder Y (2019) Flow shop with job-dependent buffer requirements\u2014a 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\u2013357. Spinger. https:\/\/doi.org\/10.1007\/978-3-030-22629-9_24","DOI":"10.1007\/978-3-030-22629-9_24"},{"issue":"4","key":"1121_CR15","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1016\/j.cor.2008.01.002","volume":"36","author":"F-C Lin","year":"2008","unstructured":"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\u20131175","journal-title":"Comput Oper Res"},{"issue":"3","key":"1121_CR16","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.datak.2008.04.010","volume":"66","author":"F-C Lin","year":"2008","unstructured":"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\u2013401","journal-title":"Data Knowl Eng"},{"issue":"1","key":"1121_CR17","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1108\/02640470910934641","volume":"27","author":"F-C Lin","year":"2009","unstructured":"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\u2013148","journal-title":"Electron Libr"},{"issue":"3","key":"1121_CR18","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/322203.322213","volume":"27","author":"CH Papadimitriou","year":"1980","unstructured":"Papadimitriou CH, Kanellakis PC (1980) Flowshop scheduling with limited temporary storage. J ACM 27(3):533\u2013549","journal-title":"J ACM"},{"key":"1121_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo ML (2016) Scheduling: theory, algorithms, and systems. Springer, Berlin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01121-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01121-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01121-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T19:06:05Z","timestamp":1713985565000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01121-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1121"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01121-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,4]]},"assertion":[{"value":"6 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"45"}}