{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T01:44:53Z","timestamp":1768527893595,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,25]],"date-time":"2023-02-25T00:00:00Z","timestamp":1677283200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,25]],"date-time":"2023-02-25T00:00:00Z","timestamp":1677283200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["884\/22"],"award-info":[{"award-number":["884\/22"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s12351-023-00744-2","type":"journal-article","created":{"date-parts":[[2023,2,25]],"date-time":"2023-02-25T10:02:47Z","timestamp":1677319367000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Lot scheduling involving completion time problems on identical parallel machines"],"prefix":"10.1007","volume":"23","author":[{"given":"Biber","family":"Nurit","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Mor","family":"Baruch","sequence":"additional","affiliation":[]},{"given":"Schlissel","family":"Yitzhak","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2320-9064","authenticated-orcid":false,"given":"Shapira","family":"Dana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,25]]},"reference":[{"issue":"3","key":"744_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0377-2217(91)90304-E","volume":"51","author":"Jacek Blazewicz","year":"1991","unstructured":"Blazewicz Jacek, Dror Moshe, Weglarz Jan (1991) Mathematical programming formulations for machine scheduling: a survey. Eur J Oper Res 51(3):283\u2013300","journal-title":"Eur J Oper Res"},{"issue":"3","key":"744_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"Sin Cheng","year":"1990","unstructured":"Cheng Sin (1990) A state-of-the-art review of parallel-machine scheduling research. Eur J Oper Res 47(3):271\u2013292","journal-title":"Eur J Oper Res"},{"key":"744_CR3","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson David S (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman"},{"key":"744_CR4","doi-asserted-by":"crossref","unstructured":"Ghalami Laleh, Grosu Daniel (2018) Scheduling parallel identical machines to minimize makespan: a parallel approximation algorithm. J Parallel Distrib Comput","DOI":"10.1016\/j.jpdc.2018.05.008"},{"key":"744_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.jpdc.2018.05.008","volume":"133","author":"Laleh Ghalami","year":"2019","unstructured":"Ghalami Laleh, Grosu Daniel (2019) Scheduling parallel identical machines to minimize makespan: a parallel approximation algorithm. J Parallel Distrib Comput 133:221\u2013231","journal-title":"J Parallel Distrib Comput"},{"issue":"2","key":"744_CR6","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"Ronald L Graham","year":"1969","unstructured":"Graham Ronald L (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17(2):416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"744_CR7","doi-asserted-by":"crossref","unstructured":"Graham Ronald\u00a0L, Lawler Eugene\u00a0L, Lenstra Jan\u00a0Karel, Kan AHG\u00a0Rinnooy (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Annals of discrete mathematics, Vol.\u00a05, 287\u2013326. Elsevier","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"12","key":"744_CR8","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.ipl.2014.06.016","volume":"114","author":"Yung-Tsung Hou","year":"2014","unstructured":"Hou Yung-Tsung, Yang Dar-Li, Kuo Wen-Hung (2014) Lot scheduling on a single machine. Inf Process Lett 114(12):718\u2013722","journal-title":"Inf Process Lett"},{"issue":"4","key":"744_CR9","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"Chung-Yee Lee","year":"1992","unstructured":"Lee Chung-Yee, Uzsoy Reha, Martin-Vega Louis A (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Oper Res 40(4):764\u2013775","journal-title":"Oper Res"},{"key":"744_CR10","doi-asserted-by":"crossref","unstructured":"Li Yuanzhe, Ghalami Laleh, Schwiebert Loren, Grosu Daniel (2018). A GPU parallel approximation algorithm for scheduling parallel identical machines to minimize makespan. In: 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 619\u2013628. IEEE","DOI":"10.1109\/IPDPSW.2018.00102"},{"key":"744_CR11","doi-asserted-by":"crossref","unstructured":"Mor Baruch (2020) Single-machine lot scheduling with variable lot processing times. Eng Optim 1\u201314","DOI":"10.1007\/s10878-020-00651-8"},{"key":"744_CR12","doi-asserted-by":"publisher","first-page":"106009","DOI":"10.1016\/j.ipl.2020.106009","volume":"164","author":"Baruch Mor","year":"2020","unstructured":"Mor Baruch, Mosheiov Gur, Shapira Dana (2020) Lot scheduling on a single machine to minimize the (weighted) number of tardy orders. Inf Process Lett 164:106009","journal-title":"Inf Process Lett"},{"issue":"1","key":"744_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-020-00651-8","volume":"41","author":"Baruch Mor","year":"2021","unstructured":"Mor Baruch, Mosheiov Gur, Shapira Dana (2021) Single machine lot scheduling with optional job-rejection. J Comb Optim 41(1):1\u201311","journal-title":"J Comb Optim"},{"issue":"2","key":"744_CR14","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.ejor.2016.06.062","volume":"256","author":"Daniel Oron","year":"2017","unstructured":"Oron Daniel, Shabtay Dvir, Steiner George (2017) Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times. Eur J Oper Res 256(2):384\u2013391","journal-title":"Eur J Oper Res"},{"issue":"6","key":"744_CR15","doi-asserted-by":"publisher","first-page":"1815","DOI":"10.1080\/00207543.2016.1253889","volume":"55","author":"Onur Ozturk","year":"2017","unstructured":"Ozturk Onur, Begen Mehmet A, Zaric Gregory S (2017) A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan. Int J Prod Res 55(6):1815\u20131831","journal-title":"Int J Prod Res"},{"key":"744_CR16","unstructured":"Pinedo Michael L (2016) Scheduling: theory, algorithms, and systems, 5th edn. Springer Publishing Company, Incorporated"},{"key":"744_CR17","doi-asserted-by":"crossref","unstructured":"Potts Chris\u00a0N, Kovalyov Mikhail\u00a0Y (2000) Scheduling with batching: a review. Eur J Oper Res 120(2): 228\u2013249. https:\/\/EconPapers.repec.org\/RePEc:eee:ejores:v:120:y:2000:i:2:p:228-249","DOI":"10.1016\/S0377-2217(99)00153-8"},{"issue":"4","key":"744_CR18","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1287\/moor.2.4.320","volume":"2","author":"Ravi Sethi","year":"1977","unstructured":"Sethi Ravi (1977) On the complexity of mean flow time scheduling. Math Oper Res 2(4):320\u2013330","journal-title":"Math Oper Res"},{"issue":"4","key":"744_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1080\/07408179208964233","volume":"24","author":"Reha Uzsoy","year":"1992","unstructured":"Uzsoy Reha, Lee Chung-Yee, Martin-Vega Louis A (1992) A review of production planning and scheduling models in the semiconductor industry part I: system characteristics, performance evaluation and production planning. IIE Trans 24(4):47\u201360","journal-title":"IIE Trans"},{"issue":"5","key":"744_CR20","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1080\/07408179408966627","volume":"26","author":"Reha Uzsoy","year":"1994","unstructured":"Uzsoy Reha, Lee Chung-Yee, Martin-Vega Louis A (1994) A review of production planning and scheduling models in the semiconductor industry part II: shop-floor control. IIE Trans 26(5):44\u201355","journal-title":"IIE Trans"},{"key":"744_CR21","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.jclepro.2018.05.056","volume":"193","author":"Shijin Wang","year":"2018","unstructured":"Wang Shijin, Wang Xiaodong, Jianbo Yu, Ma Shuan, Liu Ming (2018) Bi-objective identical parallel machine scheduling to minimize total energy consumption and makespan. J Clean Prod 193:424\u2013440","journal-title":"J Clean Prod"},{"key":"744_CR22","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ipl.2018.10.002","volume":"142","author":"E Zhang","year":"2019","unstructured":"Zhang E, Liu Ming, Zheng Feifeng, Yinfeng Xu (2019) Single machine lot scheduling to minimize the total weighted (discounted) completion time. Inf Process Lett 142:46\u201351","journal-title":"Inf Process Lett"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-023-00744-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-023-00744-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-023-00744-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T22:28:39Z","timestamp":1679869719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-023-00744-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,25]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["744"],"URL":"https:\/\/doi.org\/10.1007\/s12351-023-00744-2","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,25]]},"assertion":[{"value":"4 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2023","order":4,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"12"}}