{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T11:28:54Z","timestamp":1784287734503,"version":"3.55.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology of the Republic of China, Taiwan","doi-asserted-by":"publisher","award":["MOST 104-2410-H-182-011"],"award-info":[{"award-number":["MOST 104-2410-H-182-011"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005795","name":"Linkou Chang Gung Memorial Hospital","doi-asserted-by":"publisher","award":["CMRPD3G0011"],"award-info":[{"award-number":["CMRPD3G0011"]}],"id":[{"id":"10.13039\/501100005795","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology of the Republic of China, Taiwan","doi-asserted-by":"publisher","award":["MOST106-2221-E-027-085"],"award-info":[{"award-number":["MOST106-2221-E-027-085"]}],"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":[[2017]]},"DOI":"10.1109\/access.2017.2735538","type":"journal-article","created":{"date-parts":[[2017,8,3]],"date-time":"2017-08-03T14:13:25Z","timestamp":1501769605000},"page":"15791-15799","source":"Crossref","is-referenced-by-count":9,"title":["Uniform Parallel-Machine Scheduling for Minimizing Total Resource Consumption With a Bounded Makespan"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1343-0838","authenticated-orcid":false,"given":"Shih-Wei","family":"Lin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9549-5290","authenticated-orcid":false,"given":"Kuo-Ching","family":"Ying","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref32","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 Discrete Math"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.06.011"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.4236\/iim.2010.28056"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-013-0014-y"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMM.644-650.2030"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0212004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0213044"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0216037"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02080204","article-title":"Parametric bounds for LPT scheduling on uniform processors","volume":"7","author":"bo","year":"1991","journal-title":"Acta Math Appl Sinica"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.1.116"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02684354"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(00)00018-3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-5915.1980.tb01163.x"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2012.05.003"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.26.2.202"},{"key":"ref27","first-page":"204","article-title":"GA based heuristic to minimize makespan in single machine scheduling problem with iniform parallel machines","volume":"3","author":"senthilkumar","year":"2011","journal-title":"Intell Inf Manage"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90215-W"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00427-X"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-014-1284-3"},{"key":"ref5","first-page":"4","article-title":"Modelling parallel processors with different processing speeds of single machine scheduling problem to minimize makespan","volume":"17","author":"panneerselvam","year":"1998","journal-title":"J Engng for Ind"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2007.11.009"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(02)00427-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2012.07.023"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-2824-y"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0217033"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00243-1"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF02684446"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISCID.2010.99"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.03.045"},{"key":"ref26","first-page":"22","article-title":"Simulated annealing algorithm to ninimize makespanin single machine scheduling problem with uniform parallel machines","volume":"3","author":"senthilkumar","year":"2011","journal-title":"Intell Inf Manage"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-010-0201-1"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7859429\/08000570.pdf?arnumber=8000570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:30:15Z","timestamp":1641987015000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8000570\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2017.2735538","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}