{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T03:10:36Z","timestamp":1655521836547},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/tc.2013.40","type":"journal-article","created":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T18:29:52Z","timestamp":1407263392000},"page":"2302-2315","source":"Crossref","is-referenced-by-count":6,"title":["FTH-B&B: A Fault-Tolerant HierarchicalBranch and Bound for Large ScaleUnreliable Environments"],"prefix":"10.1109","volume":"63","author":[{"given":"Ahcene","family":"Bendjoudi","sequence":"first","affiliation":[{"name":"CERIST Research Center, 3 rue des frères Aissou, 16030 Ben-Aknoun, Algiers, Algeria"}]},{"given":"Nouredine","family":"Melab","sequence":"additional","affiliation":[{"name":"LIFL\/UMR CNRS 8022, Université Lille 1, 59655 Villeneuve d’Ascq Cedex, France"}]},{"given":"El-Ghazali","family":"Talbi","sequence":"additional","affiliation":[{"name":"LIFL\/UMR CNRS 8022, Université Lille 1, 59655 Villeneuve d’Ascq Cedex, France"}]}],"member":"263","reference":[{"key":"ref33","author":"xie","year":"2004","journal-title":"Computing Systems Reliability Models and Analysis"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"ref31","year":"0"},{"key":"ref30","first-page":"56","article-title":"Interfacing Condor and PVM to Haress the Cycles of Workstation Clusters","volume":"12","author":"pruyne","year":"1996","journal-title":"J Future Generations of Computer Systems"},{"key":"ref34","year":"0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.12921\/cmst.2006.12.01.69-77"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC.2009.35"},{"key":"ref13","year":"0"},{"key":"ref14","year":"0"},{"key":"ref15","author":"elnozahy","year":"1996","journal-title":"A Survey of Rollback-Recovery Protocols in Message-Passing Systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/22719.24067"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675885"},{"key":"ref18","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.6.1042"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1504\/IJGUC.2009.022031"},{"key":"ref28","year":"0"},{"key":"ref3","author":"baduel","year":"2006","journal-title":"Grid Computing Software Environments"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370217"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.10.002"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.339"},{"key":"ref29","year":"0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.337"},{"key":"ref7","year":"0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2003.1199364"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjdc.2.584"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2005.09.006"},{"key":"ref20","first-page":"1793","article-title":"A Linda-Based Hierarchical Master-Worker Model","volume":"1","author":"ghasemi-gol","year":"2009","journal-title":"Int?l J Computer Theory and Eng"},{"key":"ref22","author":"goux","year":"2000","journal-title":"Metacomputing and the master-worker paradigm"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/HPDC.2000.868633"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2000.876065"},{"key":"ref23","year":"0"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2007.7"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.26.1.53","article-title":"A General Boundind Scheme for the Permutation Flow-Shop Problem","volume":"26","author":"lenstra","year":"1978","journal-title":"Operations Research"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/6871433\/06470600.pdf?arnumber=6470600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T02:30:06Z","timestamp":1655519406000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6470600\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":34,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tc.2013.40","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}