{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T19:34:36Z","timestamp":1777059276232,"version":"3.51.4"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100007839","name":"Postgraduate Research and Innovation Foundation of Yunnan University","doi-asserted-by":"publisher","award":["2021Y325"],"award-info":[{"award-number":["2021Y325"]}],"id":[{"id":"10.13039\/501100007839","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3225448","type":"journal-article","created":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T19:37:30Z","timestamp":1669664250000},"page":"124858-124873","source":"Crossref","is-referenced-by-count":8,"title":["Meta-Heuristic Algorithms for the Generalized Extensible Bin Packing Problem With Overload Cost"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2720-3559","authenticated-orcid":false,"given":"Ran","family":"Ding","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Yunnan University, Kunming, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2196-7769","authenticated-orcid":false,"given":"Bin","family":"Deng","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Yunnan University, Kunming, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3094-4347","authenticated-orcid":false,"given":"Weidong","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Yunnan University, Kunming, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3213066"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.07.016"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601906"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020999407672"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45561-2_28"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45356-3_60"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-017-0561-x"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLC.2006.258954"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.4114\/ia.v14i46.1550"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.10.002"},{"key":"ref28","first-page":"1801","article-title":"Ant-colony heuristic algorithm for no-wait flow shop problem with makespan criterion","volume":"13","author":"pan","year":"1815","journal-title":"Comput Integr Manuf Systems-Beijing"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF00175354"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782653"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2017.0750"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0791"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-022-00402-y"},{"key":"ref22","article-title":"Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work","author":"xiao","year":"2022","journal-title":"arXiv 2209 08704"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.05.023"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-005-0188-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-93176-6_13"},{"key":"ref26","article-title":"Optimization, learning and natural algorithms","author":"dorigo","year":"1992"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.08.030"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2018.1519073"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-5594-5"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.05.007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67899-9_1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00895-8"},{"key":"ref13","article-title":"Stochastic extensible bin packing","author":"sagnol","year":"2020","journal-title":"arXiv 2002 00060"},{"key":"ref14","first-page":"415","article-title":"Scheduling preemptible tasks on parallel processors with information loss","volume":"3","author":"blazewicz","year":"1984","journal-title":"Technique el Science Informatiques"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-015-0464-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-017-1147-7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106449"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.12.003"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108386"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00020-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00216-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-005-0003-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.472"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2006.09.002"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.1.57.11901"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018935608981"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.07.042"},{"key":"ref45","first-page":"2008","article-title":"Particle swarm optimization based algorithm for permutation flow shop scheduling","volume":"34","author":"zhou","year":"2006","journal-title":"ACTA ELECTONICA SINICA"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.04.096"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1029\/2017JD028050"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0151576"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.12.030"},{"key":"ref44","first-page":"3281","article-title":"A discrete particle swarm optimization algorithm for single machine total earliness and tardiness problem with a common due date","author":"pan","year":"2006","journal-title":"Proc IEEE Int Conf Evol Comput"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.agrformet.2016.10.019"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09965199.pdf?arnumber=9965199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:47:32Z","timestamp":1670446052000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9965199\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3225448","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}