{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:27:04Z","timestamp":1774600024647,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90151-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"17-47","source":"Crossref","is-referenced-by-count":162,"title":["Nonclairvoyant scheduling"],"prefix":"10.1016","volume":"130","author":[{"given":"Rajeev","family":"Motwani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Torng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90151-1_BIB1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1109\/FSCS.1990.89525","article-title":"A dining philosophers algorithm with polynomial response time","author":"Awerbuch","year":"1990","journal-title":"Proc. 30th ACM Symp. on Foundations of Computers Science"},{"key":"10.1016\/0304-3975(94)90151-1_BIB2","first-page":"51","article-title":"New algorithms for an ancient scheduling problem","author":"Bartal","year":"1992","journal-title":"Proc. 24th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90151-1_BIB3","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/1780.1804","article-title":"The drinking philosophers problem","volume":"6","author":"Chandy","year":"1984","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(94)90151-1_BIB4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. of Math. Statist."},{"key":"10.1016\/0304-3975(94)90151-1_BIB5","series-title":"Operating Systems Theory","author":"Coffman","year":"1973"},{"key":"10.1016\/0304-3975(94)90151-1_BIB6","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/0304-3975(94)90151-1_BIB7","series-title":"An Introduction to Operating Systems","author":"Deitel","year":"1990"},{"key":"10.1016\/0304-3975(94)90151-1_BIB8","series-title":"The Design of OS\/2","author":"Deitel","year":"1992"},{"key":"10.1016\/0304-3975(94)90151-1_BIB9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00289519","article-title":"Hierarchical ordering of sequential processes","author":"Dijkstra","year":"1971","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)90151-1_BIB10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1109\/SFCS.1991.185355","article-title":"Dynamic scheduling on parallel machines","author":"Feldmann","year":"1991","journal-title":"Proc. 32nd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90151-1_BIB11","series-title":"VAX\/VMS Internals and Data Structures","author":"Goldberg","year":"1991"},{"key":"10.1016\/0304-3975(94)90151-1_BIB12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0304-3975(94)90151-1_BIB13","series-title":"Queuing Systems, Vol. I: Theory and Vol. II: Computer Applications","author":"Kleinrock","year":"1976"},{"key":"10.1016\/0304-3975(94)90151-1_BIB14","article-title":"Sequencing and scheduling: algorithms and complexity","volume":"Vol. 4","author":"Lawler","year":"1990"},{"key":"10.1016\/0304-3975(94)90151-1_BIB15","series-title":"Quantitative System Performance","author":"Lazowska","year":"1984"},{"key":"10.1016\/0304-3975(94)90151-1_BIB16","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(89)90096-4","article-title":"An online graph coloring algorithm with sublinear performance ratio","volume":"75","author":"Lovasz","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(94)90151-1_BIB17","author":"Lundelius","year":"1988","journal-title":"Synthesis of efficient drinking philosophers algorithms"},{"key":"10.1016\/0304-3975(94)90151-1_BIB18","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0022-0000(81)90015-5","article-title":"Upper bounds for static resource allocation in a distributed system","volume":"23","author":"Lynch","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)90151-1_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Scheduling with deadlines and loss functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Management Sci."},{"key":"10.1016\/0304-3975(94)90151-1_BIB20","first-page":"422","article-title":"Non-clairvoyant scheduling","author":"Motwani","year":"1993","journal-title":"Proc. 4th ACM-SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0304-3975(94)90151-1_BIB21","series-title":"Operating Systems Concepts","author":"Peterson","year":"1985"},{"key":"10.1016\/0304-3975(94)90151-1_BIB22","first-page":"133","article-title":"On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem","author":"Rabin","year":"1981","journal-title":"Proc. 8th ACM Symp. POPL"},{"key":"10.1016\/0304-3975(94)90151-1_BIB23","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/SFCS.1991.185361","article-title":"Scheduling parallel machines on-line","author":"Shmoys","year":"1991","journal-title":"Proc. 32nd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90151-1_BIB24","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"CACM"},{"key":"10.1016\/0304-3975(94)90151-1_BIB25","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0304-3975(94)90151-1_BIB26","first-page":"105","article-title":"Improved algorithms for distributed resource allocation","author":"Styer","year":"1988","journal-title":"Proc. 7th ACM Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0304-3975(94)90151-1_BIB27","series-title":"Modern Operating Systems","author":"Tanenbaum","year":"1992"},{"key":"10.1016\/0304-3975(94)90151-1_BIB28","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/6041.6074","article-title":"Distributed operating systems","volume":"17","author":"Tanenbaum","year":"1985","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0304-3975(94)90151-1_BIB29","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1109\/FSCS.1990.89567","article-title":"Randomized online graph coloring","author":"Vishwanathan","year":"1990","journal-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90151-1_BIB30","first-page":"222","article-title":"Probabilistic computations: towards a unified measure of complexity","author":"Yao","year":"1977","journal-title":"Proc. 18th IEEE Symp. on Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901511?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901511?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:16:48Z","timestamp":1580901408000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594901511"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90151-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}