{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:44:50Z","timestamp":1740141890132,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T00:00:00Z","timestamp":1658966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T00:00:00Z","timestamp":1658966400000},"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":["2505\/19"],"award-info":[{"award-number":["2505\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10288-022-00519-z","type":"journal-article","created":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T13:17:10Z","timestamp":1659014230000},"page":"457-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A note on batch scheduling on a two-machine flowshop with machine-dependent processing times"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9052-9375","authenticated-orcid":false,"given":"Gur","family":"Mosheiov","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Oron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,28]]},"reference":[{"key":"519_CR1","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s001860000088","volume":"52","author":"P Baptiste","year":"2000","unstructured":"Baptiste P (2000) Batching identical jobs. Math Methods Oper Res 52:355\u2013367","journal-title":"Math Methods Oper Res"},{"key":"519_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10288-003-0024-4","volume":"2","author":"P Baptiste","year":"2004","unstructured":"Baptiste P, Brucker P, Knust S (2004) Ten notes on equal-processing-time scheduling. 4OR 2:111\u2013127","journal-title":"4OR"},{"key":"519_CR3","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/153910","author":"L Ben-Dati","year":"2009","unstructured":"Ben-Dati L, Mosheiov G, Oron D (2009) Batch scheduling on a two-machine flow-shop with machine-dependent setup times. Adv Oper Res. https:\/\/doi.org\/10.1155\/2009\/153910","journal-title":"Adv Oper Res"},{"key":"519_CR4","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1080\/07408170208928925","volume":"34","author":"J Bukchin","year":"2002","unstructured":"Bukchin J, Tzur M, Jaffe M (2002) Lot splitting to minimize average flow-time in a two-machine flow-shop. IIE Trans 34:953\u2013970","journal-title":"IIE Trans"},{"key":"519_CR5","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1002\/(SICI)1520-6750(200003)47:2<128::AID-NAV4>3.0.CO;2-#","volume":"47","author":"TCE Cheng","year":"2000","unstructured":"Cheng TCE, Lin BMT, Toker A (2000) Makespan minimization in the two-machine flowshop batch scheduling problem. Nav Res Logist 47:128\u2013144","journal-title":"Nav Res Logist"},{"key":"519_CR6","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1287\/opre.37.3.426","volume":"37","author":"EG Coffman","year":"1989","unstructured":"Coffman EG, Nozari A, Yannakakis M (1989) Optimal scheduling of products with two assemblies on a single machine. Oper Res 37:426\u2013436","journal-title":"Oper Res"},{"key":"519_CR7","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1287\/mnsc.33.6.784","volume":"33","author":"G Dobson","year":"1987","unstructured":"Dobson G, Karmarkar US, Rummel JL (1987) Batching to minimize flow times on one machine. Manag Sci 33:784\u2013799","journal-title":"Manag Sci"},{"key":"519_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ijpe.2014.08.004","volume":"158","author":"E Gerstl","year":"2014","unstructured":"Gerstl E, Mosheiov G (2014) A two-stage flexible flow shop problem with unit-execution-time jobs and batching. Int J Prod Econ 158:171\u2013178","journal-title":"Int J Prod Econ"},{"key":"519_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ijpe.2017.11.015","volume":"196","author":"X Li","year":"2018","unstructured":"Li X, Zhang K (2018) Single batch processing machine scheduling with two-dimensional bin packing constraints. Int J Prod Econ 196:113\u2013121","journal-title":"Int J Prod Econ"},{"key":"519_CR10","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.cor.2007.07.007","volume":"36","author":"LL Liu","year":"2009","unstructured":"Liu LL, Ng CT, Cheng TCE (2009) Bicriterion scheduling with equal processing times on a batch. Comput Oper Res 36:110\u2013118","journal-title":"Comput Oper Res"},{"key":"519_CR11","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.ejor.2011.06.037","volume":"215","author":"B Mor","year":"2011","unstructured":"Mor B, Mosheiov G (2011) Single machine batch scheduling with two competing agents to minimize total flowtime. Eur J Oper Res 215:524\u2013531","journal-title":"Eur J Oper Res"},{"key":"519_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.ejor.2003.09.010","volume":"161","author":"G Mosheiov","year":"2005","unstructured":"Mosheiov G, Oron D (2005) A note on flow-shop and job-shop batch scheduling with identical processing-time jobs. Eur J Oper Res 161:285\u2013291","journal-title":"Eur J Oper Res"},{"key":"519_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ipl.2005.12.003","volume":"98","author":"G Mosheiov","year":"2006","unstructured":"Mosheiov G, Oron D (2006) A note on batch scheduling with sequence-dependent setup times. Inf Process Lett 98:73\u201378","journal-title":"Inf Process Lett"},{"key":"519_CR14","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1016\/j.ejor.2006.01.052","volume":"187","author":"G Mosheiov","year":"2008","unstructured":"Mosheiov G, Oron D (2008a) A single machine batch scheduling problem with bounded batch size. Eur J Oper Res 187:1069\u20131079","journal-title":"Eur J Oper Res"},{"key":"519_CR15","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1016\/j.ejor.2006.03.068","volume":"187","author":"G Mosheiov","year":"2008","unstructured":"Mosheiov G, Oron D (2008b) An m-machine open shop batch scheduling to minimize makespan. Eur J Oper Res 187:1282\u20131292","journal-title":"Eur J Oper Res"},{"key":"519_CR16","first-page":"676","volume":"58","author":"G Mosheiov","year":"2011","unstructured":"Mosheiov G, Oron D (2011) Batch scheduling on a two-machine jobshop with machine-dependent setup times. Nav Res Logist 58:676\u2013684","journal-title":"Nav Res Logist"},{"key":"519_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/nav.21740","volume":"64","author":"G Mosheiov","year":"2017","unstructured":"Mosheiov G, Strusevich V (2017) Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow. Nav Res Logist 64:217\u2013224","journal-title":"Nav Res Logist"},{"key":"519_CR18","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1002\/nav.20028","volume":"51","author":"G Mosheiov","year":"2004","unstructured":"Mosheiov G, Oron D, Ritov Y (2004) Flow-shop batch scheduling to minimize total flow-time. NRL 51:783\u2013799","journal-title":"NRL"},{"key":"519_CR19","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.orl.2004.09.007","volume":"33","author":"G Mosheiov","year":"2005","unstructured":"Mosheiov G, Oron D, Ritov Y (2005) Minimizing flow-time on a single machine with integer batch sizes. Oper Res Lett 33:497\u2013501","journal-title":"Oper Res Lett"},{"key":"519_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0166-218X(88)90049-2","volume":"21","author":"D Naddef","year":"1988","unstructured":"Naddef D, Santos C (1988) One-pass batching algorithms for the one-machine problem. Discrete Appl Math 21:133\u2013145","journal-title":"Discrete Appl Math"},{"key":"519_CR21","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10951-007-0041-9","volume":"10","author":"CT Ng","year":"2007","unstructured":"Ng CT, Kovalyov MY (2007) Batching and scheduling in a multi-machine flow shop. J Sched 10:353\u2013364","journal-title":"J Sched"},{"key":"519_CR22","doi-asserted-by":"publisher","first-page":"1815","DOI":"10.1080\/00207543.2016.1253889","volume":"55","author":"O Ozturk","year":"2017","unstructured":"Ozturk O, Begen MA, Zaric GS (2017) A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan. Int J Prod Res 55:1815\u20131831","journal-title":"Int J Prod Res"},{"key":"519_CR23","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0167-6377(85)90011-2","volume":"4","author":"C Santos","year":"1985","unstructured":"Santos C, Magazine M (1985) Batching in single operation manufacturing systems. Oper Res Lett 4:99\u2013103","journal-title":"Oper Res Lett"},{"key":"519_CR24","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0167-6377(92)90027-Z","volume":"11","author":"DF Shallcross","year":"1992","unstructured":"Shallcross DF (1992) A polynomial algorithm for a one machine batching problem. Oper Res Lett 11:213\u2013218","journal-title":"Oper Res Lett"},{"key":"519_CR25","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ejor.2016.10.024","volume":"258","author":"J-Q Wang","year":"2017","unstructured":"Wang J-Q, Fan G-Q, Zhang Y, Zhang C-W, Leung Y-T (2017) Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes. Eur J Oper Res 258:478\u2013490","journal-title":"Eur J Oper Res"},{"key":"519_CR26","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.ijpe.2004.04.014","volume":"105","author":"JJ Yuan","year":"2007","unstructured":"Yuan JJ, Lin YX, Cheng TCE, Ng CT (2007) Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time. Int J Prod Econ 105:402\u2013406","journal-title":"Int J Prod Econ"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-022-00519-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-022-00519-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-022-00519-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T18:03:54Z","timestamp":1695665034000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-022-00519-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,28]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["519"],"URL":"https:\/\/doi.org\/10.1007\/s10288-022-00519-z","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2022,7,28]]},"assertion":[{"value":"3 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All sources of funding were mentioned above (see Acknowledgement), there are no conflicts of interests, and this research does not involve human participants or animals.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical standards"}},{"value":"The authors claim that there is no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}