{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T11:16:02Z","timestamp":1767611762010,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100002383","name":"Deanship of Scientific Research at King Saud University through the Research Group Project","doi-asserted-by":"publisher","award":["RG-1438-079"],"award-info":[{"award-number":["RG-1438-079"]}],"id":[{"id":"10.13039\/501100002383","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2789678","type":"journal-article","created":{"date-parts":[[2018,1,8]],"date-time":"2018-01-08T22:36:34Z","timestamp":1515450994000},"page":"5300-5307","source":"Crossref","is-referenced-by-count":24,"title":["An Arc-Flow Model for the Makespan Minimization Problem on Identical Parallel Machines"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9482-5913","authenticated-orcid":false,"given":"Mehdi","family":"Mrad","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9150-7426","authenticated-orcid":false,"given":"Nizar","family":"Souayah","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2015.8"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.08.005"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018952112615"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.06.013"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-005-0188-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579085"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2006.06.058"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-009-9120-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35380-2_24"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-006-0032-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00726-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.06.002"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1070.0246"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2010007"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.08.008"},{"journal-title":"Machine Scheduling Problems Classification Complexity and Computations","year":"1976","author":"kan","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02568517"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73231-6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.01.001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.12.038"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.02.013"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref2"},{"key":"ref9","first-page":"97","article-title":"Scheduling to minimize the makespan on identical parallel machines: An LP-based algorithm","volume":"8","author":"mokotoff","year":"1999","journal-title":"Investigacin Operativa"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2006.00562.x"},{"article-title":"Effective solution space limitation for the identical parallel machine scheduling problem","year":"2013","author":"walter","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2007.00605.x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7535"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321917"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90215-W"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24838-5_1"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08248744.pdf?arnumber=8248744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:14:56Z","timestamp":1642004096000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8248744\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2789678","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}