{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T20:58:14Z","timestamp":1777755494752,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:00:00Z","timestamp":1591056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:00:00Z","timestamp":1591056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10479-020-03653-1","type":"journal-article","created":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T17:05:01Z","timestamp":1591117501000},"page":"113-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Due-window assignment scheduling in the proportionate flow shop setting"],"prefix":"10.1007","volume":"292","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7553-0215","authenticated-orcid":false,"given":"Xinyu","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin-Na","family":"Geng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,2]]},"reference":[{"issue":"19","key":"3653_CR1","doi-asserted-by":"crossref","first-page":"6333","DOI":"10.1080\/00207543.2018.1504252","volume":"56","author":"A Allahverdi","year":"2018","unstructured":"Allahverdi, A., & Werner, F. (2018). Scheduling in manufacturing systems: New trends and perspectives. Journal International Journal of Production Research, 56(19), 6333\u20136335.","journal-title":"Journal International Journal of Production Research"},{"key":"3653_CR2","doi-asserted-by":"publisher","unstructured":"Aqil, S., & Allali, K. (2019). On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time. Annals of Operations Research. https:\/\/doi.org\/10.1007\/s10479-019-03490-x.","DOI":"10.1007\/s10479-019-03490-x"},{"key":"3653_CR3","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.cie.2018.01.027","volume":"117","author":"C-Y Cheng","year":"2018","unstructured":"Cheng, C.-Y., Chen, K.-C., Ying, H.-H., & Lin, J.-X. (2018). Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities. Computers & Industrial Engineering, 117, 164\u2013170.","journal-title":"Computers & Industrial Engineering"},{"key":"3653_CR4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.ijpe.2012.03.027","volume":"141","author":"TCE Cheng","year":"2013","unstructured":"Cheng, T. C. E., Wu, C.-C., Chen, J.-C., Wu, W.-H., & Cheng, S.-R. (2013). Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. International Journal of Production Economics, 141, 79\u201386.","journal-title":"International Journal of Production Economics"},{"key":"3653_CR5","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.ijpe.2010.10.005","volume":"135","author":"TCE Cheng","year":"2012","unstructured":"Cheng, T. C. E., Yang, S.-J., & Yang, D.-L. (2012). Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. International Journal of Production Economics, 135, 154\u2013161.","journal-title":"International Journal of Production Economics"},{"issue":"8","key":"3653_CR6","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.1080\/0305215X.2018.1521397","volume":"51","author":"X-N Geng","year":"2019","unstructured":"Geng, X.-N., Wang, J.-B., & Bai, D. (2019). Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect. Engineering Optimization, 51(8), 1301\u20131323.","journal-title":"Engineering Optimization"},{"key":"3653_CR7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10479-013-1458-5","volume":"211","author":"E Gerstl","year":"2013","unstructured":"Gerstl, E., & Mosheiov, G. (2013). Minmax due-date assignment with a time window for acceptable lead-times. Annals of Operations Research, 211, 167\u2013177.","journal-title":"Annals of Operations Research"},{"key":"3653_CR8","volume-title":"Inequalities","author":"GH Hardy","year":"1967","unstructured":"Hardy, G. H., Littlewood, J. E., & Polya, G. (1967). Inequalities (2nd ed.). Cambridge: Cambridge University Press.","edition":"2"},{"key":"3653_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.ins.2012.10.024","volume":"224","author":"A Janiak","year":"2013","unstructured":"Janiak, A., Janiak, W., Kovalyov, M. Y., Kozan, E., & Pesch, E. (2013). Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs. Information Sciences, 224, 109\u2013117.","journal-title":"Information Sciences"},{"issue":"2","key":"3653_CR10","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.ejor.2014.09.043","volume":"242","author":"A Janiak","year":"2015","unstructured":"Janiak, A., Janiak, W. A., Krysiak, T., & Kwiatkowski, T. (2015). A survey on scheduling problems with due windows. European Journal of Operational Research, 242(2), 347\u2013357.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3653_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1080\/0305215X.2019.1573898","volume":"52","author":"C Jiang","year":"2020","unstructured":"Jiang, C., Zou, D.-X., Bai, D.-Y., & Wang, J.-B. (2020). Proportionate flowshop scheduling with position-dependent weights. Engineering Optimization, 52(1), 37\u201352.","journal-title":"Engineering Optimization"},{"key":"3653_CR12","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.ijpe.2018.10.010","volume":"206","author":"G Li","year":"2018","unstructured":"Li, G., Li, N., Sambandam, N., Sethi, S. P., & Zhang, F. (2018). Flow shop scheduling with jobs arriving at different times. International Journal of Production Economics, 206, 250\u2013260.","journal-title":"International Journal of Production Economics"},{"key":"3653_CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1023\/A:1018965919691","volume":"70","author":"SD Limana","year":"1997","unstructured":"Limana, S. D., Panwalkar, S. S., & Thongmee, S. (1997). A single machine scheduling problem with common due window and controllable processing times. Annals of Operations Research, 70, 145\u2013154.","journal-title":"Annals of Operations Research"},{"issue":"17","key":"3653_CR14","doi-asserted-by":"crossref","first-page":"5758","DOI":"10.1080\/00207543.2017.1418986","volume":"56","author":"X Liu","year":"2018","unstructured":"Liu, X., Lu, S., Pei, J., & Pardalos, P. M. (2018). A hybrid VNS-HS algorithm for a supply chain scheduling problem with deteriorating jobs. International Journal of Production Research, 56(17), 5758\u20135775.","journal-title":"International Journal of Production Research"},{"key":"3653_CR15","doi-asserted-by":"crossref","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, 1426\u20131429.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"3653_CR16","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.ejor.2016.03.037","volume":"254","author":"B Mor","year":"2017","unstructured":"Mor, B., & Mosheiov, G. (2017). Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance. European Journal of Operational Research, 254(2), 360\u2013370.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"3653_CR17","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1057\/palgrave.jors.2602439","volume":"59","author":"G Mosheiov","year":"2008","unstructured":"Mosheiov, G., & Sarig, A. (2008). A due-window assignment problem with position-dependent processing times. Journal of the Operational Research Society, 59(7), 997\u20131003.","journal-title":"Journal of the Operational Research Society"},{"issue":"7","key":"3653_CR18","doi-asserted-by":"crossref","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, 62(7), 595\u2013603.","journal-title":"Naval Research Logistics"},{"issue":"1","key":"3653_CR19","doi-asserted-by":"crossref","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, 60(1), 46\u201355.","journal-title":"Naval Research Logistics"},{"issue":"1","key":"3653_CR20","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ejor.2014.11.034","volume":"244","author":"J Pei","year":"2015","unstructured":"Pei, J., Pardalos, P. M., Liu, X., Fan, W., & Yang, S. (2015). Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. European Journal of Operations Research, 244(1), 13\u201325.","journal-title":"European Journal of Operations Research"},{"key":"3653_CR21","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10479-013-1481-6","volume":"211","author":"L-H Sun","year":"2013","unstructured":"Sun, L.-H., Cui, K., Chen, J.-H., Wang, J., & He, X.-C. (2013). Research on permutation flowshop scheduling problems with general position-dependent learning effects. Annals of Operations Research, 211, 473\u2013480.","journal-title":"Annals of Operations Research"},{"issue":"10","key":"3653_CR22","doi-asserted-by":"crossref","first-page":"3186","DOI":"10.1080\/00207543.2019.1566675","volume":"57","author":"X Sun","year":"2019","unstructured":"Sun, X., & Geng, X.-N. (2019). Single-machine scheduling with deteriorating effects and machine maintenance. International Journal of Production Research, 57(10), 3186\u20133199.","journal-title":"International Journal of Production Research"},{"key":"3653_CR23","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10479-017-2560-x","volume":"261","author":"NEH Tellache","year":"2018","unstructured":"Tellache, N. E. H., & Boudhar, M. (2018). Flow shop scheduling problem with conflict graphs. Annals of Operations Research, 261, 339\u2013363.","journal-title":"Annals of Operations Research"},{"issue":"19","key":"3653_CR24","doi-asserted-by":"crossref","first-page":"3551","DOI":"10.1080\/00207543.2018.1468095","volume":"56","author":"P Valledor","year":"2018","unstructured":"Valledor, P., Gomez, A., Priore, P., & Puente, J. (2018). Solving multi-objective rescheduling problems in dynamic permutation flow shop environments with disruptions. International Journal of Production Research, 56(19), 3551\u20133560.","journal-title":"International Journal of Production Research"},{"key":"3653_CR25","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.ins.2018.11.023","volume":"478","author":"D Wang","year":"2019","unstructured":"Wang, D., & Li, Z. (2019). Bicriterion scheduling with a negotiable common due window and resource-dependent processing times. Information Sciences, 478, 258\u2013274.","journal-title":"Information Sciences"},{"issue":"1","key":"3653_CR26","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/nav.21731","volume":"64","author":"D Wang","year":"2017","unstructured":"Wang, D., Yin, Y., & Cheng, T. C. E. (2017). A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times. Naval Research Logistics, 64(1), 41\u201363.","journal-title":"Naval Research Logistics"},{"key":"3653_CR27","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10479-011-0923-2","volume":"191","author":"J-B Wang","year":"2011","unstructured":"Wang, J.-B., & Wang, M.-Z. (2011). Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects. Annals of Operations Research, 191, 155\u2013169.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"3653_CR28","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.cor.2012.08.006","volume":"40","author":"J-B Wang","year":"2013","unstructured":"Wang, J.-B., & Wang, M.-Z. (2013). Minimizing makespan in three-machine flow shops with deteriorating jobs. Computers & Operations Research, 40(2), 547\u2013557.","journal-title":"Computers & Operations Research"},{"key":"3653_CR29","doi-asserted-by":"crossref","unstructured":"Wang, J.-B., & Wang, M.-Z. (2014). Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times. Asia-Pacific Journal of Operational Research, 31(5), 55, Article ID 1450036.","DOI":"10.1142\/S0217595914500365"},{"issue":"2","key":"3653_CR30","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1080\/0305215X.2019.1577411","volume":"52","author":"J-B Wang","year":"2020","unstructured":"Wang, J.-B., Zhang, B., Li, L., Bai, D.-Y., & Feng, Y.-B. (2020). Due-window assignment scheduling problems with position-dependent weights on a single machine. Engineering Optimization, 52(2), 185\u2013193.","journal-title":"Engineering Optimization"},{"key":"3653_CR31","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1023\/A:1016094508744","volume":"108","author":"WK Yeung","year":"2001","unstructured":"Yeung, W. K., Oguz, C., & Cheng, T. C. E. (2001). Minimizing weighted number of early and tardy jobs with a common due window involving location penalty. Annals of Operations Research, 108, 33\u201354.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3653_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1057\/jors.2012.161","volume":"65","author":"Y Yin","year":"2014","unstructured":"Yin, Y., Cheng, T. C. E., Wu, C.-C., & Cheng, S.-R. (2014). Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time. Journal of the Operational Research Society, 65(1), 1\u201313.","journal-title":"Journal of the Operational Research Society"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03653-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-020-03653-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03653-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:02:38Z","timestamp":1622592158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-020-03653-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,2]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["3653"],"URL":"https:\/\/doi.org\/10.1007\/s10479-020-03653-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,2]]},"assertion":[{"value":"2 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}