{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T05:02:18Z","timestamp":1769317338770,"version":"3.49.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T00:00:00Z","timestamp":1726876800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T00:00:00Z","timestamp":1726876800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100007465","name":"UiT The Arctic University of Norway","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100007465","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Volatility in the supply chain of critical products, notably the vaccine shortage during the pandemic, influences livelihoods and may lead to significant delays and long waiting times. Considering the capital- and time-intensive nature of capacity expansion plans, strategic operational production decisions are required best to address the supply-demand mismatches given the limited production resources. This research article investigates the production scenarios where the demand of one agent must be completed within a specified due date, hereinafter referred to as the <jats:italic>deadline<\/jats:italic>, while minimizing the maximum or total completion time of another agent's demand. For this purpose, the Two-Agent Proportionate Flowshop Scheduling Problem  with deadlines is introduced. Two polynomial-time optimization algorithms are developed to solve these optimization problems. This study will serve as a basis for further developing this practical yet understudied scheduling problem.<\/jats:p>","DOI":"10.1007\/s10479-024-06275-z","type":"journal-article","created":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T09:01:41Z","timestamp":1726909301000},"page":"543-558","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms"],"prefix":"10.1007","volume":"343","author":[{"given":"Kuo-Ching","family":"Ying","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1207-3587","authenticated-orcid":false,"given":"Pourya","family":"Pourhejazy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan-En","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,21]]},"reference":[{"issue":"1","key":"6275_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0377-2217(92)90174-8","volume":"62","author":"B Adenso-D\u00edaz","year":"1992","unstructured":"Adenso-D\u00edaz, B. (1992). Restricted neighborhood in the tabu search for the flowshop problem. European Journal of Operational Research, 62(1), 27\u201337. https:\/\/doi.org\/10.1016\/0377-2217(92)90174-8","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6275_CR2","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/0377-2217(94)00213-4","volume":"88","author":"B Adenso-D\u00edaz","year":"1996","unstructured":"Adenso-D\u00edaz, B. (1996). An SA\/TS mixture algorithm for the scheduling tardiness problem. European Journal of Operational Research, 88(3), 516\u2013524. https:\/\/doi.org\/10.1016\/0377-2217(94)00213-4","journal-title":"European Journal of Operational Research"},{"key":"6275_CR3","doi-asserted-by":"crossref","unstructured":"Ageev, A. A. (2007). A 3\/2-Approximation for the proportionate two-machine flow shop scheduling with minimum delays. In: Approximation and Online Algorithms Springer, Berlin 55\u201366","DOI":"10.1007\/978-3-540-77918-6_5"},{"issue":"2","key":"6275_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52(2), 229\u2013242. https:\/\/doi.org\/10.1287\/opre.1030.0092","journal-title":"Operations Research"},{"key":"6275_CR5","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s11590-016-1059-8","volume":"11","author":"A Agnetis","year":"2017","unstructured":"Agnetis, A., & Mosheiov, G. (2017). Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optim Lett, 11, 885\u2013892. https:\/\/doi.org\/10.1007\/s11590-016-1059-8","journal-title":"Optim Lett"},{"issue":"10","key":"6275_CR6","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1016\/0305-0548(96)00012-3","volume":"23","author":"A Allahverdi","year":"1996","unstructured":"Allahverdi, A. (1996). Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Computers & Operations Research, 23(10), 909\u2013916. https:\/\/doi.org\/10.1016\/0305-0548(96)00012-3","journal-title":"Computers & Operations Research"},{"issue":"3\u20134","key":"6275_CR7","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0360-8352(01)00011-0","volume":"39","author":"A Allahverdi","year":"2001","unstructured":"Allahverdi, A., & Savsar, M. (2001). Stochastic proportionate flowshop scheduling with setups. Computers & Industrial Engineering, 39(3\u20134), 357\u2013369. https:\/\/doi.org\/10.1016\/S0360-8352(01)00011-0","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"6275_CR9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker, K. R., & Cole Smith, J. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6(1), 7\u201316. https:\/\/doi.org\/10.1023\/A:1022231419049","journal-title":"Journal of Scheduling"},{"issue":"19","key":"6275_CR10","doi-asserted-by":"publisher","first-page":"5717","DOI":"10.1080\/00207543.2014.991843","volume":"53","author":"Y Ben-Yehoshua","year":"2015","unstructured":"Ben-Yehoshua, Y., Hariri, E., & Mosheiov, G. (2015). A note on minimising total absolute deviation of job completion times on a two-machine no-wait proportionate flowshop. International Journal of Production Research, 53(19), 5717\u20135724. https:\/\/doi.org\/10.1080\/00207543.2014.991843","journal-title":"International Journal of Production Research"},{"issue":"02","key":"6275_CR11","doi-asserted-by":"publisher","first-page":"2050046","DOI":"10.1142\/S0217595920500463","volume":"38","author":"R-X Chen","year":"2021","unstructured":"Chen, R.-X., & Li, S.-S. (2021). Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs. Asia-Pacific Journal of Operational Research, 38(02), 2050046. https:\/\/doi.org\/10.1142\/S0217595920500463","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"6275_CR12","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.cie.2018.01.027","volume":"117","author":"C-Y Cheng","year":"2018","unstructured":"Cheng, C.-Y., Ying, K.-C., Chen, H.-H., & Lin, J.-X. (2018). Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities. Computers & Industrial Engineering, 117, 164\u2013170. https:\/\/doi.org\/10.1016\/j.cie.2018.01.027","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"6275_CR13","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1145\/322261.322265","volume":"28","author":"FY Chin","year":"1981","unstructured":"Chin, F. Y., & Tsai, L.-L. (1981). On J-maximal and J-minimal flow-shop schedules. Journal of the ACM (JACM), 28(3), 462\u2013476.","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"6275_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ipl.2010.10.016","volume":"111","author":"B-C Choi","year":"2010","unstructured":"Choi, B.-C., Leung, J.Y.-T., & Pinedo, M. L. (2010). A note on makespan minimization in proportionate flow shops. Information Processing Letters, 111(2), 77\u201381. https:\/\/doi.org\/10.1016\/j.ipl.2010.10.016","journal-title":"Information Processing Letters"},{"issue":"4","key":"6275_CR15","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1080\/00207540500268780","volume":"44","author":"B-C Choi","year":"2006","unstructured":"Choi, B.-C., Yoon, S.-H., & Chung, S.-J. (2006). Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds. International Journal of Production Research, 44(4), 715\u2013728. https:\/\/doi.org\/10.1080\/00207540500268780","journal-title":"International Journal of Production Research"},{"issue":"4","key":"6275_CR16","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.ipl.2014.11.014","volume":"115","author":"J Dong","year":"2015","unstructured":"Dong, J., Jiang, Y., Zhang, A., Hu, J., & Luo, H. (2015). An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop. Information Processing Letters, 115(4), 475\u2013480. https:\/\/doi.org\/10.1016\/j.ipl.2014.11.014","journal-title":"Information Processing Letters"},{"issue":"6","key":"6275_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<253::AID-JOS30>3.0.CO;2-R","volume":"2","author":"TC Edwin Cheng","year":"1999","unstructured":"Edwin Cheng, T. C., & Shakhlevich, N. (1999). Proportionate flow shop with controllable processing times. Journal of Scheduling, 2(6), 253\u2013265. https:\/\/doi.org\/10.1002\/(SICI)1099-1425(199911\/12)2:6%3c253::AID-JOS30%3e3.0.CO;2-R","journal-title":"Journal of Scheduling"},{"issue":"6","key":"6275_CR18","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10951-008-0062-z","volume":"11","author":"A Est\u00e9vez-Fern\u00e1ndez","year":"2008","unstructured":"Est\u00e9vez-Fern\u00e1ndez, A., Mosquera, M. A., Borm, P., & Hamers, H. (2008). Proportionate flow shop games. Journal of Scheduling, 11(6), 433\u2013447. https:\/\/doi.org\/10.1007\/s10951-008-0062-z","journal-title":"Journal of Scheduling"},{"key":"6275_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109317","volume":"181","author":"XN Geng","year":"2023","unstructured":"Geng, X. N., Sun, X., Wang, J., & Pan, L. (2023). Scheduling on proportionate flow shop with job rejection and common due date assignment. Computers & Industrial Engineering, 181, 109317. https:\/\/doi.org\/10.1016\/j.cie.2023.109317","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"6275_CR20","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ipl.2014.09.004","volume":"115","author":"E Gerstl","year":"2015","unstructured":"Gerstl, E., Mor, B., & Mosheiov, G. (2015). A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop. Information Processing Letters, 115(2), 159\u2013162. https:\/\/doi.org\/10.1016\/j.ipl.2014.09.004","journal-title":"Information Processing Letters"},{"issue":"2","key":"6275_CR21","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1080\/00207543.2018.1456693","volume":"57","author":"E Gerstl","year":"2019","unstructured":"Gerstl, E., Mor, B., & Mosheiov, G. (2019). Scheduling on a proportionate flowshop to minimise total late work. International Journal of Production Research, 57(2), 531\u2013543. https:\/\/doi.org\/10.1080\/00207543.2018.1456693","journal-title":"International Journal of Production Research"},{"issue":"5","key":"6275_CR22","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10951-020-00667-2","volume":"23","author":"C Hertrich","year":"2020","unstructured":"Hertrich, C., Wei\u00df, C., Ackermann, H., Heydrich, S., & Krumke, S. O. (2020). Scheduling a proportionate flow shop of batching machines. Journal of Scheduling, 23(5), 575\u2013593. https:\/\/doi.org\/10.1007\/s10951-020-00667-2","journal-title":"Journal of Scheduling"},{"issue":"3","key":"6275_CR23","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0167-6377(02)00232-8","volume":"31","author":"S Hou","year":"2003","unstructured":"Hou, S., & Hoogeveen, H. (2003). The three-machine proportionate flow shop problem with unequal machine speeds. Operations Research Letters, 31(3), 225\u2013231. https:\/\/doi.org\/10.1016\/S0167-6377(02)00232-8","journal-title":"Operations Research Letters"},{"issue":"7\u20138","key":"6275_CR24","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s00170-007-1130-9","volume":"38","author":"Y-M Huang","year":"2008","unstructured":"Huang, Y.-M., & Shiau, D.-F. (2008). Combined column generation and constructive heuristic for a proportionate flexible flow shop scheduling. The International Journal of Advanced Manufacturing Technology, 38(7\u20138), 691\u2013704. https:\/\/doi.org\/10.1007\/s00170-007-1130-9","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"6275_CR25","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/0305215X.2019.1573898","volume":"52","author":"C Jiang","year":"2019","unstructured":"Jiang, C., Zou, D., Bai, D., & Wang, J. B. (2019). Proportionate flowshop scheduling with position-dependent weights. Engineering Optimization, 52(1), 37\u201352. https:\/\/doi.org\/10.1080\/0305215X.2019.1573898","journal-title":"Engineering Optimization"},{"issue":"2","key":"6275_CR26","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ejor.2020.01.002","volume":"284","author":"C Koulamas","year":"2020","unstructured":"Koulamas, C. (2020). The proportionate flow shop total tardiness problem. European Journal of Operational Research, 284(2), 439\u2013444. https:\/\/doi.org\/10.1016\/j.ejor.2020.01.002","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6275_CR27","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.ejor.2006.01.030","volume":"178","author":"C Koulamas","year":"2007","unstructured":"Koulamas, C., & Kyparisis, G. J. (2007). Single-machine and two-machine flowshop scheduling with general learning functions. European Journal of Operational Research, 178(2), 402\u2013407. https:\/\/doi.org\/10.1016\/j.ejor.2006.01.030","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6275_CR28","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.ejor.2008.01.031","volume":"193","author":"C Koulamas","year":"2009","unstructured":"Koulamas, C., & Kyparisis, G. J. (2009). A note on the proportionate flow shop with a bottleneck machine. European Journal of Operational Research, 193(2), 644\u2013645. https:\/\/doi.org\/10.1016\/j.ejor.2008.01.031","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6275_CR29","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1080\/00207543.2018.1468097","volume":"57","author":"S Kovalev","year":"2019","unstructured":"Kovalev, S., Kovalyov, M. Y., Mosheiov, G., & Gerstl, E. (2019). Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion. International Journal of Production Research, 57(2), 560\u2013566. https:\/\/doi.org\/10.1080\/00207543.2018.1468097","journal-title":"International Journal of Production Research"},{"issue":"2","key":"6275_CR30","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"JY-T Leung","year":"2010","unstructured":"Leung, J.Y.-T., Pinedo, M., & Wan, G. (2010). Competitive Two-Agent Scheduling and Its Applications. Operations Research, 58(2), 458\u2013469. https:\/\/doi.org\/10.1287\/opre.1090.0744","journal-title":"Operations Research"},{"issue":"2","key":"6275_CR31","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1007\/s13369-017-2900-9","volume":"43","author":"S-S Li","year":"2018","unstructured":"Li, S.-S., Chen, R.-X., & Li, W.-J. (2018). Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs. Arabian Journal for Science and Engineering, 43(2), 969\u2013978. https:\/\/doi.org\/10.1007\/s13369-017-2900-9","journal-title":"Arabian Journal for Science and Engineering"},{"issue":"04","key":"6275_CR32","doi-asserted-by":"publisher","first-page":"1750015","DOI":"10.1142\/S0217595917500154","volume":"34","author":"S-S Li","year":"2017","unstructured":"Li, S.-S., Qian, D.-L., & Chen, R.-X. (2017). Proportionate flow shop scheduling with rejection. Asia-Pacific Journal of Operational Research, 34(04), 1750015. https:\/\/doi.org\/10.1142\/S0217595917500154","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"6","key":"6275_CR33","doi-asserted-by":"publisher","first-page":"2311","DOI":"10.1007\/s11590-020-01670-4","volume":"15","author":"D-Y Lv","year":"2021","unstructured":"Lv, D.-Y., & Wang, J.-B. (2021). Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optimization Letters, 15(6), 2311\u20132319. https:\/\/doi.org\/10.1007\/s11590-020-01670-4","journal-title":"Optimization Letters"},{"issue":"1","key":"6275_CR34","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1057\/jors.2013.9","volume":"65","author":"B Mor","year":"2014","unstructured":"Mor, B., & Mosheiov, G. (2014). Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents. Journal of the Operational Research Society, 65(1), 151\u2013157. https:\/\/doi.org\/10.1057\/jors.2013.9","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"6275_CR35","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.ipl.2014.09.023","volume":"115","author":"B Mor","year":"2015","unstructured":"Mor, B., & Mosheiov, G. (2015). A note: Minimizing maximum earliness on a proportionate flowshop. Information Processing Letters, 115(2), 253\u2013255. https:\/\/doi.org\/10.1016\/j.ipl.2014.09.023","journal-title":"Information Processing Letters"},{"issue":"9","key":"6275_CR36","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1057\/jors.2014.112","volume":"66","author":"B Mor","year":"2015","unstructured":"Mor, B., & Mosheiov, G. (2015). Minimizing the number of early jobs on a proportionate flowshop. Journal of the Operational Research Society, 66(9), 1426\u20131429. https:\/\/doi.org\/10.1057\/jors.2014.112","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"6275_CR37","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.ejor.2016.03.037","volume":"254","author":"B Mor","year":"2016","unstructured":"Mor, B., & Mosheiov, G. (2016). Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance. European Journal of Operational Research, 254(2), 360\u2013370. https:\/\/doi.org\/10.1016\/j.ejor.2016.03.037","journal-title":"European Journal of Operational Research"},{"key":"6275_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-021-00697-4","author":"B Mor","year":"2021","unstructured":"Mor, B., Mosheiov, G., & Shabtay, D. (2021). Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. Journal of Scheduling. https:\/\/doi.org\/10.1007\/s10951-021-00697-4","journal-title":"Journal of Scheduling"},{"issue":"11","key":"6275_CR39","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1080\/01605682.2018.1506540","volume":"70","author":"B Mor","year":"2019","unstructured":"Mor, B., & Shapira, D. (2019). Improved algorithms for scheduling on proportionate flowshop with job-rejection. Journal of the Operational Research Society, 70(11), 1997\u20132003. https:\/\/doi.org\/10.1080\/01605682.2018.1506540","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"6275_CR40","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s40314-020-1130-z","volume":"39","author":"B Mor","year":"2020","unstructured":"Mor, B., & Shapira, D. (2020). Regular scheduling measures on proportionate flowshop with job rejection. Computational and Applied Mathematics, 39(2), 107. https:\/\/doi.org\/10.1007\/s40314-020-1130-z","journal-title":"Computational and Applied Mathematics"},{"issue":"7","key":"6275_CR41","doi-asserted-by":"publisher","first-page":"1601","DOI":"10.1016\/j.cor.2011.09.011","volume":"39","author":"G Mosheiov","year":"2012","unstructured":"Mosheiov, G., & Oron, D. (2012). Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times. Computers & Operations Research, 39(7), 1601\u20131604. https:\/\/doi.org\/10.1016\/j.cor.2011.09.011","journal-title":"Computers & Operations Research"},{"issue":"4","key":"6275_CR42","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10878-006-9001-0","volume":"12","author":"CT Ng","year":"2006","unstructured":"Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2006). A note on the complexity of the problem of two-agent scheduling on a single machine. Journal of Combinatorial Optimization, 12(4), 387\u2013394. https:\/\/doi.org\/10.1007\/s10878-006-9001-0","journal-title":"Journal of Combinatorial Optimization"},{"issue":"9","key":"6275_CR43","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1080\/01605682.2018.1495996","volume":"70","author":"D Oron","year":"2019","unstructured":"Oron, D. (2019). Batching and resource allocation decisions on an m-machine proportionate flowshop. Journal of the Operational Research Society, 70(9), 1571\u20131578. https:\/\/doi.org\/10.1080\/01605682.2018.1495996","journal-title":"Journal of the Operational Research Society"},{"issue":"7","key":"6275_CR44","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1287\/mnsc.31.7.852","volume":"31","author":"PS Ow","year":"1985","unstructured":"Ow, P. S. (1985). Focused Scheduling in Proportionate Flowshops. Management Science, 31(7), 852\u2013869. https:\/\/doi.org\/10.1287\/mnsc.31.7.852","journal-title":"Management Science"},{"issue":"2","key":"6275_CR45","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1002\/nav.21615","volume":"62","author":"SS Panwalkar","year":"2015","unstructured":"Panwalkar, S. S., & Koulamas, C. (2015). Proportionate flow shop: New complexity results and models with due date assignment. Naval Research Logistics (NRL), 62(2), 98\u2013106. https:\/\/doi.org\/10.1002\/nav.21615","journal-title":"Naval Research Logistics (NRL)"},{"issue":"7","key":"6275_CR46","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1002\/nav.21666","volume":"62","author":"SS Panwalkar","year":"2015","unstructured":"Panwalkar, S. S., & Koulamas, C. (2015). On equivalence between the proportionate flow shop and single-machine scheduling problems. Naval Research Logistics (NRL), 62(7), 595\u2013603. https:\/\/doi.org\/10.1002\/nav.21666","journal-title":"Naval Research Logistics (NRL)"},{"key":"6275_CR47","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cie.2017.03.013","volume":"107","author":"SS Panwalkar","year":"2017","unstructured":"Panwalkar, S. S., & Koulamas, C. (2017). On the dominance of permutation schedules for some ordered and proportionate flow shop problems. Computers & Industrial Engineering, 107, 105\u2013108. https:\/\/doi.org\/10.1016\/j.cie.2017.03.013","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"6275_CR48","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1002\/nav.21518","volume":"60","author":"SS Panwalkar","year":"2013","unstructured":"Panwalkar, S. S., Smith, M. L., & Koulamas, C. (2013). Review of the ordered and proportionate flow shop scheduling research. Naval Research Logistics (NRL), 60(1), 46\u201355. https:\/\/doi.org\/10.1002\/nav.21518","journal-title":"Naval Research Logistics (NRL)"},{"key":"6275_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19884-7_86","volume-title":"The palgrave handbook of supply chain management","author":"P Pourhejazy","year":"2024","unstructured":"Pourhejazy, P. (2024). Production management and supply chain integration. In J. Sarkis (Ed.), The palgrave handbook of supply chain management. Cham: Palgrave Macmillan. https:\/\/doi.org\/10.1007\/978-3-031-19884-7_86"},{"key":"6275_CR50","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10479-021-04414-4","volume":"309","author":"J Qian","year":"2022","unstructured":"Qian, J., & Han, H. (2022). Improved algorithms for proportionate flow shop scheduling with due-window assignment. Ann Oper Res, 309, 249\u2013258. https:\/\/doi.org\/10.1007\/s10479-021-04414-4","journal-title":"Ann Oper Res"},{"issue":"5","key":"6275_CR51","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1057\/jors.2015.95","volume":"67","author":"D Shabtay","year":"2016","unstructured":"Shabtay, D., & Oron, D. (2016). Proportionate flow-shop scheduling with rejection. Journal of the Operational Research Society, 67(5), 752\u2013769. https:\/\/doi.org\/10.1057\/jors.2015.95","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"6275_CR52","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y","volume":"1","author":"N Shakhlevich","year":"1998","unstructured":"Shakhlevich, N., Hoogeveen, H., & Pinedo, M. (1998). Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling, 1(3), 157\u2013168. https:\/\/doi.org\/10.1002\/(SICI)1099-1425(1998100)1:3%3c157::AID-JOS12%3e3.0.CO;2-Y","journal-title":"Journal of Scheduling"},{"issue":"2","key":"6275_CR53","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1016\/j.eswa.2006.12.002","volume":"34","author":"D Shiau","year":"2008","unstructured":"Shiau, D., Cheng, S., & Huang, Y. (2008). Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm. Expert Systems with Applications, 34(2), 1133\u20131143. https:\/\/doi.org\/10.1016\/j.eswa.2006.12.002","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"6275_CR54","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10479-020-03653-1","volume":"292","author":"X Sun","year":"2020","unstructured":"Sun, X., Geng, X.-N., & Liu, T. (2020). Due-window assignment scheduling in the proportionate flow shop setting. Annals of Operations Research, 292(1), 113\u2013131. https:\/\/doi.org\/10.1007\/s10479-020-03653-1","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06275-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06275-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06275-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T20:09:12Z","timestamp":1733515752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06275-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,21]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["6275"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06275-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,21]]},"assertion":[{"value":"22 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2024","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 that they have no known conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}