{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T16:10:12Z","timestamp":1760458212447,"version":"build-2065373602"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"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":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-025-00441-0","type":"journal-article","created":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T17:33:17Z","timestamp":1742664797000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm to Check Feasibility for Two-Level Discrete Lot-Sizing and Scheduling"],"prefix":"10.1007","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7202-6619","authenticated-orcid":false,"given":"Murat","family":"G\u00fcng\u00f6r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali Tamer","family":"\u00dcnal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,21]]},"reference":[{"issue":"4","key":"441_CR1","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1080\/00207549408956968","volume":"32","author":"W Br\u00fcggemann","year":"1994","unstructured":"Br\u00fcggemann W, Jahnke H (1994) DLSP for two-stage multi-item batch production. Int J Prod Res 32(4):755\u2013768. https:\/\/doi.org\/10.1080\/00207549408956968","journal-title":"Int J Prod Res"},{"issue":"3","key":"441_CR2","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/S0377-2217(99)00190-3","volume":"124","author":"W Br\u00fcggemann","year":"2000","unstructured":"Br\u00fcggemann W, Jahnke H (2000) Discrete lot-sizing and scheduling problem: complexity and modification for batch availability. Eur J Oper Res 124(3):511\u2013528. https:\/\/doi.org\/10.1016\/S0377-2217(99)00190-3","journal-title":"Eur J Oper Res"},{"issue":"3","key":"441_CR3","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/S0377-2217(00)00173-9","volume":"126","author":"W Br\u00fcggemann","year":"2000","unstructured":"Br\u00fcggemann W, Jahnke H (2000) Erratum to \u2018Discrete lot-sizing and scheduling problem: complexity and modification for batch availability\u2019. Eur J Oper Res 126(3):688. https:\/\/doi.org\/10.1016\/S0377-2217(00)00173-9","journal-title":"Eur J Oper Res"},{"issue":"1","key":"441_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-015-0429-4","volume":"39","author":"K Copil","year":"2017","unstructured":"Copil K, W\u00f6rbelauer M, Meyr H, Tempelmeier H (2017) Simultaneous lotsizing and scheduling problems: a classification and review of models. OR Spectr 39(1):1\u201364. https:\/\/doi.org\/10.1007\/s00291-015-0429-4","journal-title":"OR Spectr"},{"issue":"2","key":"441_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0377-2217(97)00030-1","volume":"99","author":"A Drexl","year":"1997","unstructured":"Drexl A, Kimms A (1997) Lot sizing and scheduling\u2013survey and extensions. Eur J Oper Res 99(2):221\u2013235. https:\/\/doi.org\/10.1016\/S0377-2217(97)00030-1","journal-title":"Eur J Oper Res"},{"key":"441_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0925-5273(00)00162-6","volume":"78","author":"M G\u00f6the-Lundgren","year":"2002","unstructured":"G\u00f6the-Lundgren M, Lundgren JT, Persson JA (2002) An optimization model for refinery production scheduling. Int J Prod Econ 78:255\u2013270. https:\/\/doi.org\/10.1016\/S0925-5273(00)00162-6","journal-title":"Int J Prod Econ"},{"key":"441_CR7","doi-asserted-by":"publisher","unstructured":"Lee Y, Lee K (2020) Lot-sizing and scheduling in flat-panel display manufacturing process. Omega 93. https:\/\/doi.org\/10.1016\/j.omega.2019.02.005","DOI":"10.1016\/j.omega.2019.02.005"},{"key":"441_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Kan AR, Bruker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343\u2013362. https:\/\/doi.org\/10.1016\/S0167-5060(08)70743-X","journal-title":"Ann Discret Math"},{"issue":"6","key":"441_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1287\/inte.31.7.29.9647","volume":"31","author":"IJ Lustig","year":"2001","unstructured":"Lustig IJ, Puget JF (2001) Program does not equal program: constraint programming and its relationship to mathematical programming. Interfaces 31(6):29\u201353. https:\/\/doi.org\/10.1287\/inte.31.7.29.9647","journal-title":"Interfaces"},{"issue":"1","key":"441_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1299\/jsmec.46.46","volume":"46","author":"K Muramatsu","year":"2003","unstructured":"Muramatsu K, Warman A, Kobayashi M (2003) A near-optimal solution method of multi-item multi-process dynamic lot size scheduling problem. JSME Int J Ser C Mech Syst Mach Elem Manuf 46(1):46\u201353. https:\/\/doi.org\/10.1299\/jsmec.46.46","journal-title":"JSME Int J Ser C Mech Syst Mach Elem Manuf"},{"issue":"3","key":"441_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1080\/00207540310001613656","volume":"42","author":"JA Persson","year":"2004","unstructured":"Persson JA, G\u00f6the-Lundgren M, Lundgren JT, Gendron B (2004) A tabu search heuristic for scheduling the production processes at an oil refinery. Int J Prod Res 42(3):445\u2013471. https:\/\/doi.org\/10.1080\/00207540310001613656","journal-title":"Int J Prod Res"},{"key":"441_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17101-7","author":"D Quadt","year":"2004","unstructured":"Quadt D (2004) Lot-sizing and scheduling for flexible flow lines. Springer. https:\/\/doi.org\/10.1007\/978-3-642-17101-7","journal-title":"Springer"},{"issue":"7","key":"441_CR13","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1287\/mnsc.37.7.801","volume":"37","author":"M Salomon","year":"1991","unstructured":"Salomon M, Kroon LG, Kuik R, van Wassenhove LN (1991) Some extensions of the discrete lotsizing and scheduling problem. Manag Sci 37(7):801\u2013812. https:\/\/doi.org\/10.1287\/mnsc.37.7.801","journal-title":"Manag Sci"},{"key":"441_CR14","doi-asserted-by":"publisher","unstructured":"Webster S (1999) Remarks on: some extensions of the discrete lotsizing and scheduling problem. Manag Sci 45(5):768\u2013769. ISSN 00251909. https:\/\/doi.org\/10.1287\/mnsc.45.5.768","DOI":"10.1287\/mnsc.45.5.768"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-025-00441-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-025-00441-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-025-00441-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T15:57:01Z","timestamp":1760457421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-025-00441-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,21]]},"references-count":14,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["441"],"URL":"https:\/\/doi.org\/10.1007\/s43069-025-00441-0","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2025,3,21]]},"assertion":[{"value":"4 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"39"}}