{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:41:16Z","timestamp":1775068876314,"version":"3.50.1"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan, R. O. C.","doi-asserted-by":"publisher","award":["MOST108-2221-E-027-025"],"award-info":[{"award-number":["MOST108-2221-E-027-025"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2988274","type":"journal-article","created":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T20:25:51Z","timestamp":1587068751000},"page":"74065-74082","source":"Crossref","is-referenced-by-count":20,"title":["Learning-Based Metaheuristic for Scheduling Unrelated Parallel Machines With Uncertain Setup Times"],"prefix":"10.1109","volume":"8","author":[{"given":"Chen-Yang","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pourya","family":"Pourhejazy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9549-5290","authenticated-orcid":false,"given":"Kuo-Ching","family":"Ying","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu-Fen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chieh-Wen","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","first-page":"749","article-title":"What should be minimized in a decision tree?","volume":"90","author":"fayyad","year":"1990","journal-title":"Proc AAAI"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1080\/01431160412331269698"},{"key":"ref71","first-page":"18","article-title":"Classification and regression by randomforest","volume":"2","author":"liaw","year":"2002","journal-title":"R News"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1653504"},{"key":"ref74","volume":"1","author":"altan","year":"2004","journal-title":"Cold and Hot Forging Fundamentals and Applications"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1080\/002075497195605"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116251"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2012.751510"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.06.010"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2954905"},{"key":"ref30","author":"peterson","year":"1981","journal-title":"Petri Net Theory and the Modeling of Systems"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.08.139"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/5127253"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.887865"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013333232691"},{"key":"ref60","first-page":"182","article-title":"A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times","volume":"3","author":"helal","year":"2006","journal-title":"Int J Oper Res"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/7219656"},{"key":"ref61","article-title":"An idea based on honey bee swarm for numerical optimization","author":"karaboga","year":"2005"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2012.2187890"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2884845"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2501232"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1185550"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2013.845315"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2011.2178023"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/7373617"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.12.014"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.05.013"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1021\/ie801127t"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1852-9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.11.001"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2013.02.003"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.07.029"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/10170660809509072"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2598303"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.916430"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2013.2293552"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2006.322964"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMR.962-965.2842"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.03.002"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001409007326"},{"key":"ref58","first-page":"1554","article-title":"A hybrid approach for load balancing: Using random forest and PSO approach (RFPSO)","volume":"8","author":"bala","year":"2017","journal-title":"Int J Adv Res Comput Sci"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11169-3_10"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.23919\/ICMU.2017.8330104"},{"key":"ref55","first-page":"3133","article-title":"Do we need hundreds of classifiers to solve real world classification problems?","volume":"15","author":"fern\u00e1ndez-delgado","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti171"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1201\/9781315139470"},{"key":"ref52","author":"quinlan","year":"2014","journal-title":"C4 5 Programs for Machine Learning"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12316"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/su8101033"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/21.52545"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.03.015"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(97)00013-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.2.305"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/3213926"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2600583"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.10.003"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.06.006"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2011.652263"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.09.010"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.04.004"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/07408170600559706"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.06.069"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.07.007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-008-1692-1"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.3390\/s16010100"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.07.019"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0033288"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058655"},{"key":"ref48","author":"han","year":"2011","journal-title":"Data Mining Concepts and Techniques"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1080\/15325008.2013.824048"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-003-1937-y"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-5591-8"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09069196.pdf?arnumber=9069196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:56:34Z","timestamp":1642002994000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9069196\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":74,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2988274","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}