{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:03:26Z","timestamp":1751634206536},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6833,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1016\/0166-218x(94)90005-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"145-162","source":"Crossref","is-referenced-by-count":22,"title":["Sensitivity analysis of list scheduling heuristics"],"prefix":"10.1016","volume":"55","author":[{"given":"A.W.J.","family":"Kolen","sequence":"first","affiliation":[]},{"given":"A.H.G.","family":"Rinnooy Kan","sequence":"additional","affiliation":[]},{"given":"C.P.M.","family":"van Hoesel","sequence":"additional","affiliation":[]},{"given":"A.P.M.","family":"Wagelmans","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90005-1_BIB1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1287\/moor.12.2.241","article-title":"The asymptotic optimality of the 1pt rule","volume":"12","author":"Frenk","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(94)90005-1_BIB2","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0166-218X(94)90005-1_BIB3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(94)90005-1_BIB4","first-page":"445","article-title":"Sequencing and scheduling: algorithms and complexity","volume":"4","author":"Lawler","year":"1993"},{"key":"10.1016\/0166-218X(94)90005-1_BIB5","series-title":"Ph.D. Thesis","article-title":"Sensitivity analysis in combinatorial optimization","author":"Wagelmans","year":"1990"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900051?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900051?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:29:44Z","timestamp":1555122584000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94900051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0166218X94900051"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90005-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}