{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T00:11:38Z","timestamp":1771632698115,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001786","name":"University of Adelaide","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001786","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP150104871"],"award-info":[{"award-number":["DP150104871"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61300025"],"award-info":[{"award-number":["61300025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002402","name":"Sun Yat-Sen University","doi-asserted-by":"publisher","award":["985"],"award-info":[{"award-number":["985"]}],"id":[{"id":"10.13039\/501100002402","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2017,12,1]]},"DOI":"10.1109\/tpds.2017.2731843","type":"journal-article","created":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T14:22:47Z","timestamp":1500992567000},"page":"3511-3520","source":"Crossref","is-referenced-by-count":33,"title":["Efficient Approximation Algorithms for the Bounded Flexible Scheduling Problem in Clouds"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2891-4253","authenticated-orcid":false,"given":"Longkun","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3663-6591","authenticated-orcid":false,"given":"Hong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"317","article-title":"Linear programming and the theory of games","volume":"13","author":"gale","year":"1951","journal-title":"Activity Analysis of Production and Allocation"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.04.001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321967"},{"key":"ref13","first-page":"144","article-title":"The primal-dual method for approximation algorithms and its application to network design problems","author":"goemans","year":"1997","journal-title":"Approximation Algorithms for NP-Hard Problems"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1125994.1126000"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"ref16","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":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9449-0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2742343"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73101-3"},{"key":"ref27","first-page":"89","article-title":"Discussion of a maximum problem","volume":"6","author":"von neumann","year":"1947","journal-title":"John von Neumann Collected Works"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612702"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_11"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00274-1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.38"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764535"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90053-5"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6847985"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585745"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.38"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486187"},{"key":"ref24","article-title":"Impact of precedence constraints on complexity of scheduling problems: A survey","author":"prot","year":"2015"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2009.2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45878-6_7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/8103836\/07990567.pdf?arnumber=7990567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:28Z","timestamp":1641987568000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7990567\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,1]]},"references-count":27,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2017.2731843","relation":{},"ISSN":["1045-9219"],"issn-type":[{"value":"1045-9219","type":"print"}],"subject":[],"published":{"date-parts":[[2017,12,1]]}}}