{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T17:20:11Z","timestamp":1783099211628,"version":"3.54.6"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72501138"],"award-info":[{"award-number":["72501138"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72571140"],"award-info":[{"award-number":["72571140"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72271070"],"award-info":[{"award-number":["72271070"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.cor.2026.107530","type":"journal-article","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T00:01:03Z","timestamp":1778284863000},"page":"107530","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An efficient metaheuristic algorithm for unrelated parallel machine scheduling to minimize total weighted completion time"],"prefix":"10.1016","volume":"193","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7621-9178","authenticated-orcid":false,"given":"Jianfu","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1528-4849","authenticated-orcid":false,"given":"Abderrahim","family":"Sahli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fulong","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1837-4380","authenticated-orcid":false,"given":"Chengbin","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7368-1746","authenticated-orcid":false,"given":"Naiming","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cor.2026.107530_b1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1080\/07408179908969814","article-title":"Scheduling jobs on unrelated parallel machines to minimize regular total cost functions","volume":"31","author":"Azizoglu","year":"1999","journal-title":"IIE Trans."},{"issue":"17","key":"10.1016\/j.cor.2026.107530_b2","doi-asserted-by":"crossref","first-page":"3551","DOI":"10.1016\/j.ins.2011.04.010","article-title":"Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation","volume":"181","author":"Balin","year":"2011","journal-title":"Inform. Sci."},{"key":"10.1016\/j.cor.2026.107530_b3","first-page":"693","article-title":"Metaheuristic techniques","author":"Bandaru","year":"2016","journal-title":"Decis. Sci."},{"key":"10.1016\/j.cor.2026.107530_b4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Srinivasan, A., Svensson, O., 2016. Lift-and-round to improve weighted completion time on unrelated machines. In: Proceedings of the Forty-Eighth Annual Acm Symposium on Theory of Computing. pp. 156\u2013167.","DOI":"10.1145\/2897518.2897572"},{"issue":"7","key":"10.1016\/j.cor.2026.107530_b5","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","article-title":"Scheduling independent tasks to reduce mean finishing time","volume":"17","author":"Bruno","year":"1974","journal-title":"Commun. ACM"},{"issue":"4","key":"10.1016\/j.cor.2026.107530_b6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s10951-016-0485-x","article-title":"An exact extended formulation for the unrelated parallel machine total weighted completion time problem","volume":"20","author":"B\u00fclb\u00fcl","year":"2017","journal-title":"J. Sched."},{"issue":"2","key":"10.1016\/j.cor.2026.107530_b7","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.ejor.2017.06.051","article-title":"An integrated approach for scheduling health care activities in a hospital","volume":"264","author":"Burdett","year":"2018","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107530_b8","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1016\/j.ejor.2024.03.011","article-title":"A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs","volume":"316","author":"Chen","year":"2024","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107530_b9","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","article-title":"Solving parallel machine scheduling problems by column generation","volume":"11","author":"Chen","year":"1999","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107530_b10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s11704-018-7155-4","article-title":"Set-based discrete particle swarm optimization and its applications: a survey","volume":"12","author":"Chen","year":"2018","journal-title":"Front. Comput. Sci."},{"issue":"2","key":"10.1016\/j.cor.2026.107530_b11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/(SICI)1099-1425(199903\/04)2:2<73::AID-JOS18>3.0.CO;2-Q","article-title":"A min-sum 3\/2-approximation algorithm for scheduling unrelated parallel machines","volume":"2","author":"Chudak","year":"1999","journal-title":"J. Sched."},{"key":"10.1016\/j.cor.2026.107530_b12","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","article-title":"A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 special session on real parameter optimization","volume":"15","author":"Garc\u00eda","year":"2009","journal-title":"J. Heuristics"},{"key":"10.1016\/j.cor.2026.107530_b13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discret. Math."},{"key":"10.1016\/j.cor.2026.107530_b14","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.cie.2017.09.037","article-title":"Scheduling non-identical parallel batch processing machines to minimize total weighted tardiness using particle swarm optimization","volume":"113","author":"Hulett","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107530_b15","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.asoc.2018.11.027","article-title":"Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities","volume":"75","author":"Jia","year":"2019","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107530_b16","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/j.ejor.2020.08.010","article-title":"Ideal schedules in parallel machine settings","volume":"290","author":"Jiang","year":"2021","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107530_b17","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.cie.2008.05.007","article-title":"A discrete particle swarm optimization algorithm for scheduling parallel machines","volume":"56","author":"Kashan","year":"2009","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107530_b18","series-title":"Proceedings of ICNN\u201995-International Conference on Neural Networks","first-page":"1942","article-title":"Particle swarm optimization","volume":"Vol. 4","author":"Kennedy","year":"1995"},{"issue":"4","key":"10.1016\/j.cor.2026.107530_b19","doi-asserted-by":"crossref","first-page":"FOCS17","DOI":"10.1137\/17M1156332","article-title":"Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations","volume":"49","author":"Li","year":"2020","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.cor.2026.107530_b20","doi-asserted-by":"crossref","first-page":"2145","DOI":"10.1016\/j.apm.2008.05.019","article-title":"Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms","volume":"33","author":"Li","year":"2009","journal-title":"Appl. Math. Model."},{"issue":"1","key":"10.1016\/j.cor.2026.107530_b21","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.ejor.2021.10.015","article-title":"Iterative beam search algorithms for the permutation flowshop","volume":"301","author":"Libralesso","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107530_b22","article-title":"Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates","volume":"2013","author":"Lin","year":"2013","journal-title":"Math. Probl. Eng."},{"issue":"6","key":"10.1016\/j.cor.2026.107530_b23","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1016\/j.cor.2010.08.018","article-title":"Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems","volume":"38","author":"Lin","year":"2011","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"10.1016\/j.cor.2026.107530_b24","doi-asserted-by":"crossref","first-page":"6429","DOI":"10.1016\/j.eswa.2010.02.075","article-title":"A modified particle swarm optimization algorithm for a single-machine scheduling problem with periodic maintenance","volume":"37","author":"Low","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107530_b25","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.asoc.2015.12.035","article-title":"A robust hybrid approach based on particle swarm optimization and genetic algorithm to minimize the total machine load on unrelated parallel machines","volume":"41","author":"Mir","year":"2016","journal-title":"Appl. Soft Comput."},{"issue":"5","key":"10.1016\/j.cor.2026.107530_b26","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s00170-009-2426-8","article-title":"A hybrid particle swarm optimization for parallel machine total tardiness scheduling","volume":"49","author":"Niu","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"10.1016\/j.cor.2026.107530_b27","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/j.ejor.2009.03.049","article-title":"Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations","volume":"201","author":"Plateau","year":"2010","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107530_b28","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10479-012-1164-8","article-title":"GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times","volume":"201","author":"Rodriguez","year":"2012","journal-title":"Ann. Oper. Res."},{"issue":"7","key":"10.1016\/j.cor.2026.107530_b29","doi-asserted-by":"crossref","first-page":"1829","DOI":"10.1016\/j.cor.2013.01.018","article-title":"An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem","volume":"40","author":"Rodriguez","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107530_b30","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107219","article-title":"A new bifuzzy optimization method for remanufacturing scheduling using extended discrete particle swarm optimization algorithm","volume":"156","author":"Shi","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107530_b31","doi-asserted-by":"crossref","DOI":"10.1287\/ijoc.2023.0399","article-title":"Solving cutting stock problems via an extended Ryan-Foster branching scheme and fast column generation","author":"da Silva","year":"2025","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107530_b32","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/375827.375840","article-title":"Convex quadratic and semidefinite programming relaxations in scheduling","volume":"48","author":"Skutella","year":"2001","journal-title":"J. ACM"},{"key":"10.1016\/j.cor.2026.107530_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106509","article-title":"Biased random-key genetic algorithm for the job sequencing and tool switching problem with non-identical parallel machines","volume":"163","author":"Soares","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107530_b34","series-title":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No. 04TH8753)","first-page":"1412","article-title":"Particle swarm optimization algorithm for single machine total weighted tardiness problem","volume":"2","author":"Tasgetiren","year":"2004"},{"issue":"4","key":"10.1016\/j.cor.2026.107530_b35","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.cie.2010.02.012","article-title":"Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems","volume":"58","author":"Unlu","year":"2010","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.cor.2026.107530_b36","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/ijoc.14.2.175.119","article-title":"Experimental comparison of approximation algorithms for scheduling unrelated parallel machines","volume":"14","author":"Vredeveld","year":"2002","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107530_b37","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.omega.2018.07.005","article-title":"Effective heuristic for large-scale unrelated parallel machines scheduling problems","volume":"83","author":"Wang","year":"2019","journal-title":"Omega"},{"issue":"8","key":"10.1016\/j.cor.2026.107530_b38","doi-asserted-by":"crossref","first-page":"2131","DOI":"10.1016\/j.apm.2014.10.012","article-title":"Uniform parallel machine scheduling with resource consumption constraint","volume":"39","author":"Yeh","year":"2015","journal-title":"Appl. Math. Model."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001486?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001486?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T16:35:20Z","timestamp":1783096520000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":38,"alternative-id":["S0305054826001486"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107530","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient metaheuristic algorithm for unrelated parallel machine scheduling to minimize total weighted completion time","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107530","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107530"}}