{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:38:55Z","timestamp":1740145135596,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T00:00:00Z","timestamp":1659484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T00:00:00Z","timestamp":1659484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72071057","71922009","71690230"],"award-info":[{"award-number":["72071057","71922009","71690230"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Basic scientific research Projects in central colleges and Universities","award":["JZ2018HGTB0232"],"award-info":[{"award-number":["JZ2018HGTB0232"]}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71521001"],"award-info":[{"award-number":["71521001"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11590-022-01915-4","type":"journal-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T03:23:35Z","timestamp":1659497015000},"page":"879-900","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A variable neighborhood search algorithm for a PET\/CT examination scheduling problem considering multi-stage process and deteriorating effect"],"prefix":"10.1007","volume":"17","author":[{"given":"Kaining","family":"Shao","sequence":"first","affiliation":[]},{"given":"Wenjuan","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Zishu","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Shanlin","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,3]]},"reference":[{"issue":"1","key":"1915_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ijrobp.2010.12.060","volume":"82","author":"M Aristophanous","year":"2012","unstructured":"Aristophanous, M., Berbeco, R.I., Killoran, J.H., Yap, J.T., Sher, D.J., Allen, A.M., Larson, E., Chen, A.B.: Clinical utility of 4D FDG-PET\/CT scans in radiation treatment planning. Int. J. Radiat. Oncol. Biol. Phys. 82(1), 99\u2013105 (2012). https:\/\/doi.org\/10.1016\/j.ijrobp.2010.12.060","journal-title":"Int. J. Radiat. Oncol. Biol. Phys."},{"issue":"2","key":"1915_CR2","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1007\/s00500-020-05234-7","volume":"25","author":"OA Ar\u0131k","year":"2021","unstructured":"Ar\u0131k, O.A.: Population-based Tabu search with evolutionary strategies for permutation flow shop scheduling problems under effects of position-dependent learning and linear deterioration. Soft. Comput. 25(2), 1501\u20131518 (2021). https:\/\/doi.org\/10.1007\/s00500-020-05234-7","journal-title":"Soft. Comput."},{"key":"1915_CR3","first-page":"11","volume-title":"Evolutionary and Swarm Intelligence Algorithms","author":"JC Bansal","year":"2019","unstructured":"Bansal, J.C.: Particle swarm optimization. In: Bansal, J.C., Singh, P.K., Pal, N.R. (eds.) Evolutionary and Swarm Intelligence Algorithms, pp. 11\u201323. Springer, Cham (2019)"},{"issue":"3","key":"1915_CR4","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0305-0548(02)00198-3","volume":"31","author":"\u00dc Bilge","year":"2004","unstructured":"Bilge, \u00dc., Kira\u00e7, F., Kurtulan, M., Pekg\u00fcn, P.: A tabu search algorithm for parallel machine total tardiness problem. Comput. Oper. Res. 31(3), 397\u2013414 (2004). https:\/\/doi.org\/10.1016\/S0305-0548(02)00198-3","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"1915_CR5","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.1016\/j.apm.2010.10.015","volume":"35","author":"TCE Cheng","year":"2011","unstructured":"Cheng, T.C.E., Lee, W.C., Wu, C.C.: Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times. Appl. Math. Model. 35(4), 1861\u20131867 (2011). https:\/\/doi.org\/10.1016\/j.apm.2010.10.015","journal-title":"Appl. Math. Model."},{"key":"1915_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.cor.2014.02.006","volume":"47","author":"WW Cui","year":"2014","unstructured":"Cui, W.W., Lu, Z., Pan, E.: Integrated production scheduling and maintenance policy for robustness in a single machine. Comput. Oper. Res. 47, 81\u201391 (2014). https:\/\/doi.org\/10.1016\/j.cor.2014.02.006","journal-title":"Comput. Oper. Res."},{"key":"1915_CR7","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.asoc.2018.08.002","volume":"72","author":"O Engin","year":"2018","unstructured":"Engin, O., G\u00fc\u00e7l\u00fc, A.: A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Appl. Soft Comput. J. 72, 166\u2013176 (2018). https:\/\/doi.org\/10.1016\/j.asoc.2018.08.002","journal-title":"Appl. Soft Comput. J."},{"issue":"2","key":"1915_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: Complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976). https:\/\/doi.org\/10.1287\/moor.1.2.117","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1915_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010). https:\/\/doi.org\/10.1007\/s10479-009-0657-6","journal-title":"Ann. Oper. Res."},{"issue":"10","key":"1915_CR10","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","volume":"33","author":"P Hansen","year":"2006","unstructured":"Hansen, P., Mladenovi\u0107, N., Uro\u0161evi\u0107, D.: Variable neighborhood search and local branching. Comput. Oper. Res. 33(10), 3034\u20133045 (2006). https:\/\/doi.org\/10.1016\/j.cor.2005.02.033","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1915_CR11","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.ejor.2007.04.050","volume":"188","author":"M Ji","year":"2008","unstructured":"Ji, M., Cheng, T.C.E.: Parallel-machine scheduling with simple linear deterioration to minimize total completion time. Eur. J. Oper. Res. 188(2), 342\u2013347 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2007.04.050","journal-title":"Eur. J. Oper. Res."},{"key":"1915_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: With setup times included. Naval Res. Logist. Q. 1, 61\u201368 (1954)","journal-title":"Naval Res. Logist. Q."},{"key":"1915_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cie.2017.04.040","volume":"109","author":"C Koulamas","year":"2017","unstructured":"Koulamas, C.: Common due date assignment with generalized earliness\/tardiness penalties. Comput. Ind. Eng. 109, 79\u201383 (2017). https:\/\/doi.org\/10.1016\/j.cie.2017.04.040","journal-title":"Comput. Ind. Eng."},{"issue":"7","key":"1915_CR14","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1007\/s11590-019-01462-5","volume":"14","author":"SS Li","year":"2020","unstructured":"Li, S.S., Chen, R.X.: Scheduling with common due date assignment to minimize generalized weighted earliness\u2013tardiness penalties. Optim. Lett. 14(7), 1681\u20131699 (2020). https:\/\/doi.org\/10.1007\/s11590-019-01462-5","journal-title":"Optim. Lett."},{"key":"1915_CR15","doi-asserted-by":"publisher","first-page":"105701","DOI":"10.1016\/j.asoc.2019.105701","volume":"84","author":"S Liu","year":"2019","unstructured":"Liu, S., Pei, J., Cheng, H., Liu, X., Pardalos, P.M.: Two-stage hybrid flow shop scheduling on parallel batching machines considering a job-dependent deteriorating effect and non-identical job sizes. Appl. Soft Comput. J. 84, 105701 (2019). https:\/\/doi.org\/10.1016\/j.asoc.2019.105701","journal-title":"Appl. Soft Comput. J."},{"issue":"6","key":"1915_CR16","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.1016\/j.apm.2009.08.023","volume":"34","author":"MM Mazdeh","year":"2010","unstructured":"Mazdeh, M.M., Zaerpour, F., Zareei, A., Hajinezhad, A.: Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs. Appl. Math. Model. 34(6), 1498\u20131510 (2010). https:\/\/doi.org\/10.1016\/j.apm.2009.08.023","journal-title":"Appl. Math. Model."},{"key":"1915_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-93025-1_4","volume-title":"Evolutionary Algorithms and Neural Networks","author":"S Mirjalili","year":"2019","unstructured":"Mirjalili, S.: Genetic algorithm. In: Mirjalili, S. (ed.) Evolutionary Algorithms and Neural Networks, pp. 43\u201355. Springer, Cham (2019a)"},{"key":"1915_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-93025-1_3","volume-title":"Evolutionary Algorithms and Neural Networks","author":"S Mirjalili","year":"2019","unstructured":"Mirjalili, S.: Ant colony optimisation. In: Mirjalili, S. (ed.) Evolutionary Algorithms and Neural Networks, pp. 33\u201342. Springer, Cham (2019)"},{"issue":"11","key":"1915_CR19","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997). https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","journal-title":"Comput. Oper. Res."},{"key":"1915_CR20","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.omega.2017.12.003","volume":"82","author":"J Pei","year":"2019","unstructured":"Pei, J., Liu, X., Fan, W., Pardalos, P.M., Lu, S.: A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers. Omega (UK) 82, 55\u201369 (2019). https:\/\/doi.org\/10.1016\/j.omega.2017.12.003","journal-title":"Omega (UK)"},{"key":"1915_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.12.024","author":"BF Rosa","year":"2017","unstructured":"Rosa, B.F., Souza, M.J.F., de Souza, S.R., de Fran\u00e7a Filho, M.F., Ales, Z., Michelon, P.Y.P.: Algorithms for job scheduling problems with distinct time windows and general earliness\/tardiness penalties. Comput. Oper. Res. (2017). https:\/\/doi.org\/10.1016\/j.cor.2016.12.024","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1915_CR22","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/j.ejor.2019.07.055","volume":"289","author":"DA Rossit","year":"2021","unstructured":"Rossit, D.A., V\u00e1squez, \u00d3.C., Tohm\u00e9, F., Frutos, M., Safe, M.D.: A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems. Eur. J. Oper. Res. 289(3), 841\u2013854 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2019.07.055","journal-title":"Eur. J. Oper. Res."},{"key":"1915_CR23","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Ruiz","year":"2019","unstructured":"Ruiz, R., Pan, Q.K., Naderi, B.: Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega (UK) 83, 213\u2013222 (2019). https:\/\/doi.org\/10.1016\/j.omega.2018.03.004","journal-title":"Omega (UK)"},{"issue":"1","key":"1915_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). https:\/\/doi.org\/10.1016\/j.ejor.2009.09.024","journal-title":"Eur. J. Oper. Res."},{"key":"1915_CR25","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.cor.2019.06.015","volume":"111","author":"S S\u00e1nchez-Herrera","year":"2019","unstructured":"S\u00e1nchez-Herrera, S., Montoya-Torres, J.R., Solano-Charris, E.L.: Flow shop scheduling problem with position-dependent processing times. Comput. Oper. Res. 111, 325\u2013345 (2019). https:\/\/doi.org\/10.1016\/j.cor.2019.06.015","journal-title":"Comput. Oper. Res."},{"key":"1915_CR26","unstructured":"Steward, B.W., Wild, C.P.: World cancer report 2014. Technical report, World Health Organization, International Agency for Research on Cancer (2014)"},{"key":"1915_CR27","doi-asserted-by":"publisher","DOI":"10.1115\/1.2893988","author":"PW Tse","year":"1999","unstructured":"Tse, P.W., Atherton, D.P.: Prediction of machine deterioration using vibration based fault trends and recurrent neural networks. J. Vib. Acoust. (1999). https:\/\/doi.org\/10.1115\/1.2893988","journal-title":"J. Vib. Acoust."},{"issue":"02","key":"1915_CR28","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1142\/S021759590700122X","volume":"24","author":"JB Wang","year":"2007","unstructured":"Wang, J.B., Cheng, T.E.: Scheduling problems with the effects of deterioration and learning. Asia-Pac. J. Oper. Res. 24(02), 245\u2013261 (2007). https:\/\/doi.org\/10.1142\/S021759590700122X","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"4","key":"1915_CR29","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.omega.2005.07.008","volume":"35","author":"JB Wang","year":"2007","unstructured":"Wang, J.B.: Single-machine scheduling problems with the effects of learning and deterioration. Omega 35(4), 397\u2013402 (2007). https:\/\/doi.org\/10.1016\/j.omega.2005.07.008","journal-title":"Omega"},{"key":"1915_CR30","unstructured":"World Health Organization: GLOBOCAN 2018 (2018). http:\/\/globocan.iarc.fr\/Default.aspx. Accessed 1 Oct 2020"},{"key":"1915_CR31","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1016\/j.cie.2019.06.048","volume":"135","author":"X Wu","year":"2019","unstructured":"Wu, X., Shen, X., Li, C.: The flexible job-shop scheduling problem considering deterioration effect and energy consumption simultaneously. Comput. Ind. Eng. 135, 1004\u20131024 (2019). https:\/\/doi.org\/10.1016\/j.cie.2019.06.048","journal-title":"Comput. Ind. Eng."},{"key":"1915_CR32","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.trb.2017.10.008","volume":"106","author":"L Zhen","year":"2017","unstructured":"Zhen, L., Liang, Z., Zhuge, D., Lee, L.H., Chew, E.P.: Daily berth planning in a tidal port with channel flow control. Transp. Res. Part B Methodol. 106, 193\u2013217 (2017). https:\/\/doi.org\/10.1016\/j.trb.2017.10.008","journal-title":"Transp. Res. Part B Methodol."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01915-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01915-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01915-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T13:18:36Z","timestamp":1681305516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01915-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,3]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1915"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01915-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,8,3]]},"assertion":[{"value":"22 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}