{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T01:06:34Z","timestamp":1763082394545,"version":"3.45.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T00:00:00Z","timestamp":1740268800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T00:00:00Z","timestamp":1740268800000},"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":["2509\/19"],"award-info":[{"award-number":["2509\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11590-025-02188-3","type":"journal-article","created":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T08:44:28Z","timestamp":1740300268000},"page":"1871-1882","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A note: on the two-stage flowshop with dedicated machines to minimize total load"],"prefix":"10.1007","volume":"19","author":[{"given":"Alessandro","family":"Agnetis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2824-8214","authenticated-orcid":false,"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,23]]},"reference":[{"issue":"1","key":"2188_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1080\/07408170490247368","volume":"36","author":"TCE Cheng","year":"2004","unstructured":"Cheng, T.C.E., Kovalyov, M.Y., Chakhlevich, K.N.: Batching in a two-stage flowshop with dedicated machines in the second stage. IIE Trans. 36(1), 87\u201393 (2004)","journal-title":"IIE Trans."},{"issue":"11","key":"2188_CR2","doi-asserted-by":"publisher","first-page":"3031","DOI":"10.1016\/j.cor.2009.02.001","volume":"36","author":"TE Cheng","year":"2009","unstructured":"Cheng, T.E., Lin, B.M., Tian, Y.: Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times. Comput. Oper. Res. 36(11), 3031\u20133040 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2188_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0925-5273(96)00063-1","volume":"48","author":"CY Ching","year":"1997","unstructured":"Ching, C.Y., Liao, C.J., Wu, C.J.: Batching to minimize total production time for two part types. Int. J. Prod. Econ. 48(1), 63\u201372 (1997)","journal-title":"Int. J. Prod. Econ."},{"key":"2188_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ipl.2017.12.004","volume":"132","author":"S Fiszman","year":"2018","unstructured":"Fiszman, S., Mosheiov, G.: Minimizing total load on a proportionate flowshop with position-dependent processing times and job rejection. Inf. Process. Lett. 132, 39\u201343 (2018)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"2188_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2478\/v10209-011-0004-y","volume":"37","author":"E Gerstl","year":"2012","unstructured":"Gerstl, E., Mosheiov, G.: A two-stage flow shop scheduling with a critical machine and batch availability. Found. Comput. Decis. Sci. 37(1), 39\u201356 (2012)","journal-title":"Found. Comput. Decis. Sci."},{"key":"2188_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ijpe.2013.06.018","volume":"146","author":"E Gerstl","year":"2013","unstructured":"Gerstl, E., Mosheiov, G.: A two-stage flow shop batch scheduling problem with the option of using not-all-machines. Int. J. Prod. Econ. 146, 161\u2013166 (2013)","journal-title":"Int. J. Prod. Econ."},{"key":"2188_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10951-013-0343-z","volume":"17","author":"E Gerstl","year":"2014","unstructured":"Gerstl, E., Mosheiov, G.: The optimal number of used machines in a two-stage flexible flow shop scheduling problem. J. Sched. 17, 199\u2013210 (2014)","journal-title":"J. Sched."},{"key":"2188_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.: A two-stage flexible flowshop problem with unit-execution-time jobs and batching. Int. J. Prod. Econ. 158, 171\u2013178 (2014)","journal-title":"Int. J. Prod. Econ."},{"key":"2188_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2478\/fcds-2014-0001","volume":"39","author":"E Gerstl","year":"2014","unstructured":"Gerstl, E., Mosheiov, G., Sarig, A.: Batch scheduling in a two stage flexible flowshop problem. Found. Comput. Decis. Sci. 39, 3\u201316 (2014)","journal-title":"Found. Comput. Decis. Sci."},{"key":"2188_CR10","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.dam.2023.05.027","volume":"338","author":"E Gerstl","year":"2023","unstructured":"Gerstl, E., Mosheiov, G.: The LPT heuristic for minimizing total load on a proportionate openshop. Discret. Appl. Math. 338, 190\u2013198 (2023)","journal-title":"Discret. Appl. Math."},{"issue":"8","key":"2188_CR11","doi-asserted-by":"publisher","first-page":"1731","DOI":"10.1007\/s11590-011-0365-4","volume":"6","author":"H Hadda","year":"2012","unstructured":"Hadda, H., Dridi, N., Hajri-Gabouj, S.: A note on the two-stage hybrid flow shop problem with dedicated machines. Optim. Lett. 6(8), 1731\u20131736 (2012)","journal-title":"Optim. Lett."},{"issue":"8","key":"2188_CR12","doi-asserted-by":"publisher","first-page":"2329","DOI":"10.1007\/s11590-014-0741-y","volume":"8","author":"H Hadda","year":"2014","unstructured":"Hadda, H., Dridi, N., Hajri-Gabouj, S.: Exact resolution of the two-stage hybrid flow shop with dedicated machines. Optim. Lett. 8(8), 2329\u20132339 (2014)","journal-title":"Optim. Lett."},{"issue":"17","key":"2188_CR13","doi-asserted-by":"publisher","first-page":"5073","DOI":"10.1080\/00207543.2013.784418","volume":"51","author":"TC Huang","year":"2013","unstructured":"Huang, T.C., Lin, B.M.: Batch scheduling in differentiation flow shops for makespan minimisation. Int. J. Prod. Res. 51(17), 5073\u20135082 (2013)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"2188_CR14","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1057\/jors.2015.61","volume":"67","author":"FJ Hwang","year":"2016","unstructured":"Hwang, F.J., Lin, B.M.: Two-stage flexible flow shop scheduling subject to fixed job sequences. J. Oper. Res. Soc. 67(3), 506\u2013515 (2016)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"2188_CR15","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/S0377-2217(99)00327-6","volume":"127","author":"GJ Kyparisis","year":"2000","unstructured":"Kyparisis, G.J., Koulamas, C.: Flow shop and open shop scheduling with a critical machine and two operations per job. Eur. J. Oper. Res. 127(1), 120\u2013125 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2188_CR16","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1008009621190","volume":"10","author":"CY Lee","year":"1998","unstructured":"Lee, C.Y., Vairaktarakis, G.L.: Performance comparison of some classes of flexible flow shops and job shops. Int. J. Flex. Manuf. Syst. 10(4), 379\u2013405 (1998)","journal-title":"Int. J. Flex. Manuf. Syst."},{"issue":"2","key":"2188_CR17","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1109\/TASE.2023.3244331","volume":"21","author":"T Li","year":"2023","unstructured":"Li, T., Meng, Y., Tang, L.: Scheduling of continuous annealing with a multi-objective differential evolution algorithm based on deep reinforcement learning. IEEE Trans. Autom. Sci. Eng. 21(2), 1767\u20131780 (2023)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"4","key":"2188_CR18","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1080\/00207543.2014.944631","volume":"53","author":"BM Lin","year":"2015","unstructured":"Lin, B.M.: Two-stage flow shop scheduling with dedicated machines. Int. J. Prod. Res. 53(4), 1094\u20131097 (2015)","journal-title":"Int. J. Prod. Res."},{"key":"2188_CR19","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s11590-019-01526-6","volume":"14","author":"B Mor","year":"2020","unstructured":"Mor, B., Mosheiov, G.: Minimizing total load on parallel machines with linear deterioration. Optim. Lett. 14, 771\u2013779 (2020)","journal-title":"Optim. Lett."},{"key":"2188_CR20","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10951-019-00612-y","volume":"23","author":"B Mor","year":"2020","unstructured":"Mor, B., Mosheiov, G., Shapira, D.: Flowshop scheduling with learning effect and job rejection. J. Sched. 23, 631\u2013641 (2020)","journal-title":"J. Sched."},{"issue":"2","key":"2188_CR21","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.ejor.2009.03.018","volume":"201","author":"G Mosheiov","year":"2010","unstructured":"Mosheiov, G., Sarig, A.: Minimum weighted number of tardy jobs on an m-machine flow-shop with a critical machine. Eur. J. Oper. Res. 201(2), 404\u2013408 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2188_CR22","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0377-2217(03)00236-4","volume":"157","author":"G Mosheiov","year":"2004","unstructured":"Mosheiov, G., Yovel, U.: Comments on \u201cFlow shop and open shop scheduling with a critical machine and two operations per job.\u201d Eur. J. Oper. Res. 157(1), 257\u2013261 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"17","key":"2188_CR23","doi-asserted-by":"publisher","first-page":"4353","DOI":"10.1080\/00207540210159536","volume":"40","author":"F Riane","year":"2002","unstructured":"Riane, F., Artiba, A., Elmaghraby, S.E.: Sequencing a hybrid two-stage flowshop with dedicated machines. Int. J. Prod. Res. 40(17), 4353\u20134380 (2002)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"2188_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz, R., V\u00e1zquez-Rodr\u00edguez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1\u201318 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2188_CR25","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.: Batching in single operation manufacturing systems. Oper. Res. Lett. 4(3), 99\u2013103 (1985)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"2188_CR26","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10951-017-0529-x","volume":"21","author":"L Shen","year":"2018","unstructured":"Shen, L., Gupta, J.N.: Family scheduling with batch availability in flow shops to minimize makespan. J. Sched. 21(2), 235\u2013249 (2018)","journal-title":"J. Sched."},{"issue":"5","key":"2188_CR27","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1080\/00207540802691374","volume":"48","author":"J Yang","year":"2010","unstructured":"Yang, J.: A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines. Int. J. Prod. Res. 48(5), 1531\u20131538 (2010)","journal-title":"Int. J. Prod. Res."},{"issue":"8","key":"2188_CR28","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.ipl.2014.02.009","volume":"114","author":"X Yu","year":"2014","unstructured":"Yu, X., Zhang, Y., Huang, K.: Multi-machine scheduling with general position-based deterioration to minimize total load revisited. Inf. Process. Lett. 114(8), 399\u2013404 (2014)","journal-title":"Inf. Process. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-025-02188-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-025-02188-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-025-02188-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T01:02:48Z","timestamp":1763082168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-025-02188-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,23]]},"references-count":28,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2188"],"URL":"https:\/\/doi.org\/10.1007\/s11590-025-02188-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2025,2,23]]},"assertion":[{"value":"12 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 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 have no relevant financial or non-financial interests to disclose. The authors have no competing interests to declare that are relevant to the content of this article. All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript. The authors have no financial or proprietary interests in any material discussed in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}