{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T19:43:17Z","timestamp":1777491797177,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T00:00:00Z","timestamp":1722988800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T00:00:00Z","timestamp":1722988800000},"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":["72271240"],"award-info":[{"award-number":["72271240"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2022JJ30671"],"award-info":[{"award-number":["2022JJ30671"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s12293-024-00421-7","type":"journal-article","created":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T06:17:20Z","timestamp":1723011440000},"page":"355-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Parallel machine scheduling with job family, release time, and mold availability constraints: model and two solution approaches"],"prefix":"10.1007","volume":"16","author":[{"given":"Xiang","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuning","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junhua","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boquan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingwu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,7]]},"reference":[{"key":"421_CR1","volume-title":"Scheduling: theory, algorithms, and systems","author":"M Pinedo","year":"1992","unstructured":"Pinedo M, Hadavi K (1992) Scheduling: theory, algorithms, and systems. Springer, Berlin"},{"issue":"2","key":"421_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.ejor.2022.03.045","volume":"305","author":"M Geurtsen","year":"2023","unstructured":"Geurtsen M, Didden JBHC, Adan J, Atan Z, Adan I (2023) Production, maintenance and resource scheduling: a review. Eur J Oper Res 305(2):501\u2013529. https:\/\/doi.org\/10.1016\/j.ejor.2022.03.045","journal-title":"Eur J Oper Res"},{"issue":"1","key":"421_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10479-012-1059-8","volume":"213","author":"N Hashemian","year":"2014","unstructured":"Hashemian N, Diallo C, Vizvari B (2014) Makespan minimization for parallel machines scheduling with multiple availability constraints. Ann Oper Res 213(1):173\u2013186. https:\/\/doi.org\/10.1007\/s10479-012-1059-8","journal-title":"Ann Oper Res"},{"key":"421_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.cie.2016.09.020","volume":"101","author":"J Yoo","year":"2016","unstructured":"Yoo J, Lee IS (2016) Parallel machine scheduling with maintenance activities. Comput Ind Eng 101:361\u2013371. https:\/\/doi.org\/10.1016\/j.cie.2016.09.020","journal-title":"Comput Ind Eng"},{"issue":"3","key":"421_CR5","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1016\/j.cie.2011.05.009","volume":"61","author":"C Zhao","year":"2011","unstructured":"Zhao C, Ji M, Tang H (2011) Parallel-machine scheduling with an availability constraint. Comput Ind Eng 61(3):778\u2013781. https:\/\/doi.org\/10.1016\/j.cie.2011.05.009","journal-title":"Comput Ind Eng"},{"key":"421_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.cor.2019.03.004","volume":"107","author":"M Nattaf","year":"2019","unstructured":"Nattaf M, Dauz\u00e8re-P\u00e9r\u00e8s S, Yugma C, Wu C-H (2019) Parallel machine scheduling with time constraints on machine qualifications. Comput Oper Res 107:61\u201376. https:\/\/doi.org\/10.1016\/j.cor.2019.03.004","journal-title":"Comput Oper Res"},{"key":"421_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109219","volume":"179","author":"MC Santoro","year":"2023","unstructured":"Santoro MC, Junqueira L (2023) Unrelated parallel machine scheduling models with machine availability and eligibility constraints. Comput Ind Eng 179:109219. https:\/\/doi.org\/10.1016\/j.cie.2023.109219","journal-title":"Comput Ind Eng"},{"issue":"6","key":"421_CR8","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1002\/nav.21863","volume":"66","author":"X Xiong","year":"2019","unstructured":"Xiong X, Zhou P, Yin Y, Cheng TCE, Li D (2019) An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines. Naval Res Logist (NRL) 66(6):502\u2013516. https:\/\/doi.org\/10.1002\/nav.21863","journal-title":"Naval Res Logist (NRL)"},{"issue":"6","key":"421_CR9","doi-asserted-by":"publisher","first-page":"3464","DOI":"10.1111\/itor.13110","volume":"29","author":"J Gao","year":"2022","unstructured":"Gao J, Zhu X, Zhang R (2022) A branch-and-price approach to the multitasking scheduling with batch control on parallel machines. Int Trans Oper Res 29(6):3464\u20133485. https:\/\/doi.org\/10.1111\/itor.13110","journal-title":"Int Trans Oper Res"},{"issue":"4","key":"421_CR10","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s12293-019-00296-z","volume":"11","author":"M Tan","year":"2019","unstructured":"Tan M, Yang H-L, Su Y-X (2019) Genetic algorithms with greedy strategy for green batch scheduling on non-identical parallel machines. Memet Comput 11(4):439\u2013452. https:\/\/doi.org\/10.1007\/s12293-019-00296-z","journal-title":"Memet Comput"},{"issue":"4","key":"421_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10951-014-0397-6","volume":"19","author":"A Bitar","year":"2016","unstructured":"Bitar A, Dauz\u00e8re-P\u00e9r\u00e8s S, Yugma C, Roussel R (2016) A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing. J Sched 19(4):367\u2013376. https:\/\/doi.org\/10.1007\/s10951-014-0397-6","journal-title":"J Sched"},{"issue":"4","key":"421_CR12","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1137\/0215081","volume":"15","author":"T Kawaguchi","year":"1986","unstructured":"Kawaguchi T, Kyan S (1986) Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM J Comput 15(4):1119\u20131129. https:\/\/doi.org\/10.1137\/0215081","journal-title":"SIAM J Comput"},{"issue":"1","key":"421_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10951-010-0190-0","volume":"14","author":"K Lee","year":"2011","unstructured":"Lee K, Leung JY-T, Pinedo ML (2011) Scheduling jobs with equal processing times subject to machine eligibility constraints. J Sched 14(1):27\u201338. https:\/\/doi.org\/10.1007\/s10951-010-0190-0","journal-title":"J Sched"},{"key":"421_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105999","author":"S Maecker","year":"2023","unstructured":"Maecker S, Shen L, Monch L (2023) Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2022.105999","journal-title":"Comput Oper Res"},{"issue":"1","key":"421_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10479-019-03267-2","volume":"285","author":"S Maecker","year":"2020","unstructured":"Maecker S, Shen L (2020) Solving parallel machine problems with delivery times and tardiness objectives. Ann Oper Res 285(1):315\u2013334. https:\/\/doi.org\/10.1007\/s10479-019-03267-2","journal-title":"Ann Oper Res"},{"issue":"6","key":"421_CR16","doi-asserted-by":"publisher","first-page":"2451","DOI":"10.1109\/TCOMM.2017.2685383","volume":"65","author":"D Zhou","year":"2017","unstructured":"Zhou D, Sheng M, Wang X, Xu C, Liu R, Li J (2017) Mission aware contact plan design in resource-limited small satellite networks. IEEE Trans Commun 65(6):2451\u20132466. https:\/\/doi.org\/10.1109\/TCOMM.2017.2685383","journal-title":"IEEE Trans Commun"},{"key":"421_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123649","volume":"249","author":"X Lin","year":"2024","unstructured":"Lin X, Chen Y, Xue J, Zhang B, He L, Chen Y (2024) Large-volume leo satellite imaging data networked transmission scheduling problem: model and algorithm. Expert Syst Appl 249:123649. https:\/\/doi.org\/10.1016\/j.eswa.2024.123649","journal-title":"Expert Syst Appl"},{"key":"421_CR18","doi-asserted-by":"publisher","unstructured":"Zhu R, Lin X, Wu S, Fu W, Luo L, Zhang B (2023) Resource sharing among edge service providers: Modeling and solution. In: 2023 9th international conference on big data and information analytics (BigDIA), pp 322\u2013329. https:\/\/doi.org\/10.1109\/BigDIA60676.2023.10429529","DOI":"10.1109\/BigDIA60676.2023.10429529"},{"key":"421_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.asoc.2016.10.039","volume":"50","author":"M Afzalirad","year":"2017","unstructured":"Afzalirad M, Rezaeian J (2017) A realistic variant of bi-objective unrelated parallel machine scheduling problem: NSGA-II and MOACO approaches. Appl Soft Comput 50:109\u2013123. https:\/\/doi.org\/10.1016\/j.asoc.2016.10.039","journal-title":"Appl Soft Comput"},{"key":"421_CR20","doi-asserted-by":"publisher","unstructured":"Fu B, Huo Y, Zhao H (2011) Approximation schemes for parallel machine scheduling with availability constraints. Discret Appl Math 159(15):1555\u20131565. https:\/\/doi.org\/10.1016\/j.dam.2011.06.007","DOI":"10.1016\/j.dam.2011.06.007"},{"key":"421_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-023-00790-w","author":"L Yu","year":"2023","unstructured":"Yu L, Tan Z (2023) Scheduling with periodic availability constraints to minimize makespan. J Sched. https:\/\/doi.org\/10.1007\/s10951-023-00790-w","journal-title":"J Sched"},{"key":"421_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105813","volume":"144","author":"A Perraudat","year":"2022","unstructured":"Perraudat A, Dauz\u00e8re-P\u00e9r\u00e8s S, Vialletelle P (2022) Optimizing multiple qualifications of products on non-identical parallel machines. Comput Oper Res 144:105813. https:\/\/doi.org\/10.1016\/j.cor.2022.105813","journal-title":"Comput Oper Res"},{"issue":"3","key":"421_CR23","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"C-Y Lee","year":"1996","unstructured":"Lee C-Y (1996) Machine scheduling with an availability constraint. J Global Optim 9(3):395\u2013416. https:\/\/doi.org\/10.1007\/BF00121681","journal-title":"J Global Optim"},{"issue":"1","key":"421_CR24","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10479-012-1107-4","volume":"213","author":"A Obeid","year":"2014","unstructured":"Obeid A, Dauz\u00e8re-P\u00e9r\u00e8s S, Yugma C (2014) Scheduling job families on non-identical parallel machines with time constraints. Ann Oper Res 213(1):221\u2013234. https:\/\/doi.org\/10.1007\/s10479-012-1107-4","journal-title":"Ann Oper Res"},{"issue":"6","key":"421_CR25","doi-asserted-by":"publisher","first-page":"6814","DOI":"10.1016\/j.eswa.2010.12.064","volume":"38","author":"S Balin","year":"2011","unstructured":"Balin S (2011) Non-identical parallel machine scheduling using genetic algorithm. Expert Syst Appl 38(6):6814\u20136821. https:\/\/doi.org\/10.1016\/j.eswa.2010.12.064","journal-title":"Expert Syst Appl"},{"key":"421_CR26","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1016\/j.procs.2022.01.365","volume":"200","author":"J Berndorfer","year":"2022","unstructured":"Berndorfer J, Parragh SN (2022) Modeling and solving a real world machine scheduling problem with due windows and processing set restrictions. Procedia Comput Sci 200:1646\u20131653. https:\/\/doi.org\/10.1016\/j.procs.2022.01.365","journal-title":"Procedia Comput Sci"},{"key":"421_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114548","volume":"172","author":"K Jaklinovi\u0107","year":"2021","unstructured":"Jaklinovi\u0107 K, Durasevi\u0107 M, Jakobovi\u0107 D (2021) Designing dispatching rules with genetic programming for the unrelated machines environment with constraints. Expert Syst Appl 172:114548. https:\/\/doi.org\/10.1016\/j.eswa.2020.114548","journal-title":"Expert Syst Appl"},{"issue":"1","key":"421_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G Schmidt","year":"2000","unstructured":"Schmidt G (2000) Scheduling with limited machine availability1This work has been partially supported by INTAS grant 96-0812.1. Eur J Oper Res 121(1):1\u201315. https:\/\/doi.org\/10.1016\/S0377-2217(98)00367-1","journal-title":"Eur J Oper Res"},{"key":"421_CR29","doi-asserted-by":"publisher","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Chapter 9 sequencing and scheduling: algorithms and complexity. In: Handbooks in operations research and management science. Logistics of production and inventory, vol 4. Elsevier, Amsterdam, pp 445\u2013522. https:\/\/doi.org\/10.1016\/S0927-0507(05)80189-6","DOI":"10.1016\/S0927-0507(05)80189-6"},{"issue":"2","key":"421_CR30","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10845-015-1117-6","volume":"29","author":"M Afzalirad","year":"2018","unstructured":"Afzalirad M, Shafipour M (2018) Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions. J Intell Manuf 29(2):423\u2013437. https:\/\/doi.org\/10.1007\/s10845-015-1117-6","journal-title":"J Intell Manuf"},{"key":"421_CR31","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.engappai.2018.10.012","volume":"77","author":"JEC Arroyo","year":"2019","unstructured":"Arroyo JEC, Leung JY-T, Tavares RG (2019) An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times. Eng Appl Artif Intell 77:239\u2013254. https:\/\/doi.org\/10.1016\/j.engappai.2018.10.012","journal-title":"Eng Appl Artif Intell"},{"key":"421_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105005","volume":"123","author":"I Vla\u0161i\u0107","year":"2020","unstructured":"Vla\u0161i\u0107 I, \u0110urasevi\u0107 M, Jakobovi\u0107 D (2020) A comparative study of solution representations for the unrelated machines environment. Comput Oper Res 123:105005. https:\/\/doi.org\/10.1016\/j.cor.2020.105005","journal-title":"Comput Oper Res"},{"key":"421_CR33","doi-asserted-by":"publisher","unstructured":"Recalde D, Rutten C, Schuurman P, Vredeveld T (2010) Local search performance guarantees for restricted related parallel machine scheduling. In: LopezOrtiz, A (ed.) LATIN 2010: theoretical informatics, vol 6034, p 108. https:\/\/doi.org\/10.1007\/978-3-642-12200-2_11","DOI":"10.1007\/978-3-642-12200-2_11"},{"key":"421_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116909","volume":"199","author":"L Ulaga","year":"2022","unstructured":"Ulaga L, \u0110urasevi\u0107 M, Jakobovi\u0107 D (2022) Local search based methods for scheduling in the unrelated parallel machines environment. Expert Syst Appl 199:116909. https:\/\/doi.org\/10.1016\/j.eswa.2022.116909","journal-title":"Expert Syst Appl"},{"key":"421_CR35","doi-asserted-by":"publisher","unstructured":"Tadumadze G, Emde S, Diefenbach H (2020) Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines. OR Spectr 42(2):461\u2013497. https:\/\/doi.org\/10.1007\/s00291-020-00586-w","DOI":"10.1007\/s00291-020-00586-w"},{"issue":"4598","key":"421_CR36","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680. https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"issue":"4","key":"421_CR37","first-page":"104","volume":"20","author":"S Ye","year":"2011","unstructured":"Ye S, Kai LI (2011) Research on simulated annealing scheduling algorithm for parallel machine problem. Oper Res Manag Sci 20(4):104\u2013320","journal-title":"Oper Res Manag Sci"},{"key":"421_CR38","doi-asserted-by":"publisher","unstructured":"Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. The MIT Press, Massachusetts. https:\/\/doi.org\/10.7551\/mitpress\/1090.001.0001","DOI":"10.7551\/mitpress\/1090.001.0001"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-024-00421-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-024-00421-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-024-00421-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T07:20:14Z","timestamp":1726212014000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-024-00421-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,7]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["421"],"URL":"https:\/\/doi.org\/10.1007\/s12293-024-00421-7","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,7]]},"assertion":[{"value":"26 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}