{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:06:41Z","timestamp":1725494801909},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662792"},{"type":"electronic","value":"9783540484479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48447-7_14","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T21:42:14Z","timestamp":1194990134000},"page":"122-133","source":"Crossref","is-referenced-by-count":4,"title":["The Lazy Bureaucrat Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Esther M.","family":"Arkin","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Bender","sequence":"additional","affiliation":[]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Steven S.","family":"Skiena","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating the throughput of real-time multiple machine scheduling. In Proc. 31st ACM Symp. Theory of Computing, 1999.","DOI":"10.1145\/301250.301420"},{"key":"14_CR2","volume-title":"Computers and Intractability: A Guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"D. Karger, C. Stein, and J. Wein. Scheduling algorithms. In CRC Handbook of Computer Science, 1997. To appear.","DOI":"10.1201\/9781420049503-c36"},{"key":"14_CR4","volume-title":"Schindler\u2019s List","author":"T. Keneally","year":"1993","unstructured":"T. Keneally. Schindler\u2019s List. Touchstone Publishers, New York, 1993."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume":"4","author":"E. Lawler","year":"1993","unstructured":"E. Lawler, J. Lenstra, A. Kan, and D. Shmoys. Sequencing and scheduling: Algorithms and complexity. In Handbooks of Operations Research and Management Science, volume 4, pages 445\u2013522. Elsevier Science Publishers B.V., 1993.","journal-title":"Handbooks of Operations Research and Management Science"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"E. L. Lawler","year":"1969","unstructured":"E. L. Lawler and J. M. Moore. A functional equation and its application to resource allocation and sequencing problems. Management Science, 16:77\u201384, 1969.","journal-title":"Management Science"},{"key":"14_CR7","unstructured":"M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 1995."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48447-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T10:54:38Z","timestamp":1556967278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48447-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662792","9783540484479"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-48447-7_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}