{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T07:12:53Z","timestamp":1718262773652},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"DOI":"10.1093\/comjnl\/bxm059","type":"journal-article","created":{"date-parts":[[2007,8,30]],"date-time":"2007-08-30T00:49:15Z","timestamp":1188434955000},"page":"216-226","source":"Crossref","is-referenced-by-count":5,"title":["Average-Case Performance Analysis Of Online Non-Clairvoyant Scheduling Of Parallel Tasks With Precedence Constraints"],"prefix":"10.1093","volume":"51","author":[{"given":"K.","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2007,8,29]]},"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/51\/2\/216\/996768\/bxm059.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T20:19:19Z","timestamp":1503433159000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxm059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,29]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2007,8,29]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxm059","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,29]]}}}