{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:41Z","timestamp":1740122441371,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T00:00:00Z","timestamp":1634083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T00:00:00Z","timestamp":1634083200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003182","name":"Siberian Branch, Russian Academy of Sciences","doi-asserted-by":"publisher","award":["0314-2019-0014"],"award-info":[{"award-number":["0314-2019-0014"]}],"id":[{"id":"10.13039\/501100003182","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10898-021-01097-w","type":"journal-article","created":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T12:56:19Z","timestamp":1634129779000},"page":"445-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6144-0251","authenticated-orcid":false,"given":"Alexander","family":"Kononov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2395-1450","authenticated-orcid":false,"given":"Julia","family":"Memar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2024-8129","authenticated-orcid":false,"given":"Yakov","family":"Zinder","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,13]]},"reference":[{"issue":"3","key":"1097_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.: Scheduling for data gathering networks with data compression. Eur. J. Oper. Res. 246(3), 744\u2013749 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1097_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.: Heuristics for scheduling data gathering with limited base station memory. Ann. Oper. Res. 285(1), 149\u2013159 (2020)","journal-title":"Ann. Oper. Res."},{"key":"1097_CR3","doi-asserted-by":"publisher","first-page":"2433","DOI":"10.1007\/s11590-020-01645-5","volume":"15","author":"J Berli\u0144ska","year":"2020","unstructured":"Berli\u0144ska, J., Kononov, A., Zinder, Y.: Two-machine flow shop with dynamic storage space. Optim. Lett. 15, 2433\u20132454 (2020)","journal-title":"Optim. Lett."},{"issue":"1","key":"1097_CR4","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, J.K., Kan, A.R.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5(1), 11\u201324 (1983)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"1097_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.: Flow-shop problems with intermediate buffers. OR Spectr. 25(4), 549\u2013574 (2003)","journal-title":"OR Spectr."},{"key":"1097_CR6","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.: Complex Scheduling. Springer, Berlin (2012)"},{"key":"1097_CR7","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.: Flow Shop Scheduling. Springer, Berlin (2013)"},{"key":"1097_CR8","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.dam.2018.07.002","volume":"261","author":"A Ernst","year":"2018","unstructured":"Ernst, A., Fung, J., Singh, G., Zinder, Y.: Flexible flow shop with dedicated buffers. Discrete Appl. Math. 261, 148\u2013163 (2018)","journal-title":"Discrete Appl. Math."},{"key":"1097_CR9","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.: Capacity planning in supply chains of mineral resources. Inf. Sci. 316, 397\u2013418 (2015)","journal-title":"Inf. Sci."},{"issue":"2","key":"1097_CR10","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.: Permutation schedules for a two-machine flow shop with storage. Oper. Res. Lett. 44(2), 153\u2013157 (2016)","journal-title":"Oper. Res. Lett."},{"key":"1097_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jda.2018.11.011","volume":"52\u201353","author":"H Gu","year":"2018","unstructured":"Gu, H., Kononov, A., Memar, J., Zinder, Y.: Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J. Discrete Algorithms 52\u201353, 143\u2013155 (2018)","journal-title":"J. Discrete Algorithms"},{"issue":"13","key":"1097_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ifacol.2019.11.159","volume":"52","author":"H Gu","year":"2019","unstructured":"Gu, H., Memar, J., Zinder, Y.: Improved Lagrangian relaxation-based optimisation procedure for scheduling with storage. IFAC-PapersOnLine 52(13), 100\u2013105 (2019)","journal-title":"IFAC-PapersOnLine"},{"issue":"1","key":"1097_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two-and three-stage production schedules with setup times included. Naval Res. Logist. Q. 1(1), 61\u201368 (1954)","journal-title":"Naval Res. Logist. Q."},{"issue":"4","key":"1097_CR14","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, J.S., Kononova, P., Lin, F.C.: Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications. J. Sched. 15(4), 487\u2013497 (2012)","journal-title":"J. Sched."},{"key":"1097_CR15","doi-asserted-by":"crossref","unstructured":"Kononov, A., Memar, J., Zinder, Y.: Flow shop with job-dependent buffer requirements\u2014a polynomial-time algorithm and efficient heuristics. In: International Conference on Mathematical Optimisation Theory and Operations Research, pp. 342\u2013357. Springer (2019)","DOI":"10.1007\/978-3-030-22629-9_24"},{"issue":"1","key":"1097_CR16","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1134\/S1990478913010067","volume":"7","author":"P Kononova","year":"2013","unstructured":"Kononova, P., Kochetov, Y.A.: The variable neighborhood search for the two machine flow shop problem with a passive prefetch. J. Appl. Ind. Math. 7(1), 54\u201367 (2013)","journal-title":"J. Appl. Ind. Math."},{"key":"1097_CR17","doi-asserted-by":"crossref","unstructured":"Le, H.T., Geser, P., Middendorf, M.: An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine. In: European Conference on Evolutionary Computation in Combinatorial Optimisation (Part of EvoStar), pp. 50\u201365. Springer (2019)","DOI":"10.1007\/978-3-030-16711-0_4"},{"key":"1097_CR18","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1162\/evco_a_00287","volume":"29","author":"HT Le","year":"2021","unstructured":"Le, H.T., Geser, P., Middendorf, M.: Iterated local search and other algorithms for buffered two-machine permutation flow shops with constant processing times on one machine. Evolut. Comput. 29, 415\u2013439 (2021)","journal-title":"Evolut. Comput."},{"issue":"4","key":"1097_CR19","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1016\/j.cor.2008.01.002","volume":"36","author":"FC Lin","year":"2009","unstructured":"Lin, F.C., Hong, J.S., Lin, B.M.: A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations. Comput. Oper. Res. 36(4), 1158\u20131175 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1097_CR20","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.is.2012.05.008","volume":"38","author":"FC Lin","year":"2013","unstructured":"Lin, F.C., Hong, J.S., Lin, B.M.: Sequence optimisation for media objects with due date constraints in multimedia presentations from digital libraries. Inf. Syst. 38(1), 82\u201396 (2013)","journal-title":"Inf. Syst."},{"issue":"3","key":"1097_CR21","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.datak.2008.04.010","volume":"66","author":"FC Lin","year":"2008","unstructured":"Lin, F.C., Lai, C.Y., Hong, J.S.: Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries. Data Knowl. Eng. 66(3), 382\u2013401 (2008)","journal-title":"Data Knowl. Eng."},{"key":"1097_CR22","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10951-019-00608-8","volume":"23","author":"Y Min","year":"2019","unstructured":"Min, Y., Choi, B.C., Park, M.J.: Two-machine flow shops with an optimal permutation schedule under a storage constraint. J. Sched. 23, 327\u2013336 (2019)","journal-title":"J. Sched."},{"issue":"3","key":"1097_CR23","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/322203.322213","volume":"27","author":"CH Papadimitriou","year":"1980","unstructured":"Papadimitriou, C.H., Kanellakis, P.C.: Flowshop scheduling with limited temporary storage. J. ACM 27(3), 533\u2013549 (1980)","journal-title":"J. ACM"},{"key":"1097_CR24","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, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer, Berlin (2016)"},{"issue":"8","key":"1097_CR25","doi-asserted-by":"publisher","first-page":"2293","DOI":"10.1016\/j.cor.2005.09.004","volume":"34","author":"A Witt","year":"2007","unstructured":"Witt, A., Vo\u00df, S.: Simple heuristics for scheduling with limited intermediate storage. Comput. Oper. Res. 34(8), 2293\u20132309 (2007)","journal-title":"Comput. Oper. Res."},{"key":"1097_CR26","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/s10878-021-00706-4","volume":"42","author":"Y Zinder","year":"2021","unstructured":"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\u2013309 (2021)","journal-title":"J. Comb. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01097-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01097-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01097-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T05:14:49Z","timestamp":1655788489000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01097-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,13]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1097"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01097-w","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,10,13]]},"assertion":[{"value":"15 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}