{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:40:28Z","timestamp":1772372428390,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3705,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0890-5401(03)00060-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T17:13:10Z","timestamp":1051117990000},"page":"129-146","source":"Crossref","is-referenced-by-count":18,"title":["The Lazy Bureaucrat scheduling problem"],"prefix":"10.1016","volume":"184","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":"78","reference":[{"key":"10.1016\/S0890-5401(03)00060-9_BIB1","series-title":"Proceedings of the Sixth Workshop on Discrete Algorithms (WADS)","first-page":"122","article-title":"The Lazy Bureaucrat scheduling problem","volume":"vol. 1663","author":"Arkin","year":"1999"},{"key":"10.1016\/S0890-5401(03)00060-9_BIB2","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, S. Guha, J. Naor, B. Schieber, Approximating the throughput of real-time multiple machine scheduling, in: Proceedings of the 31st ACM Symposium Theory of Computing (STOC), 1999, pp. 622\u2013631","DOI":"10.1145\/301250.301420"},{"key":"10.1016\/S0890-5401(03)00060-9_BIB3","series-title":"Proceedings of the Sixth Conference on Integer Programming and Combinatorial Optimization (IPCO)","first-page":"195","article-title":"The maximum traveling salesman problem under polyhedral norms","volume":"vol. 1412","author":"Barvinok","year":"1998"},{"key":"10.1016\/S0890-5401(03)00060-9_BIB4","unstructured":"S.P. Fekete, Simplicity and hardness of the maximum traveling salesman problem under geometric distances, in: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 337\u2013345"},{"key":"10.1016\/S0890-5401(03)00060-9_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0890-5401(03)00060-9_BIB6","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"Journal of ACM"},{"issue":"3","key":"10.1016\/S0890-5401(03)00060-9_BIB7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0020-0190(98)00102-1","article-title":"An approximation algorithm for the maximum traveling salesman problem","volume":"67","author":"Hassin","year":"1998","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0890-5401(03)00060-9_BIB8","series-title":"Proceedings of the Eighth Scandinavian Workshop on Algorithm Theory (SWAT)","first-page":"40","article-title":"Minimizing makespan for the lazy bureaucrat problem","volume":"vol. 2368","author":"Hepner","year":"2002"},{"issue":"1","key":"10.1016\/S0890-5401(03)00060-9_BIB9","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF02523689","article-title":"On approximating the longest path in a graph","volume":"18","author":"Karger","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0890-5401(03)00060-9_BIB10","series-title":"Algorithms and Theory of Computation Handbook","article-title":"Scheduling algorithms","author":"Karger","year":"1999"},{"key":"10.1016\/S0890-5401(03)00060-9_BIB11","series-title":"Schindler\u2019s List","author":"Keneally","year":"1993"},{"key":"10.1016\/S0890-5401(03)00060-9_BIB12","doi-asserted-by":"crossref","unstructured":"S.R. Kosaraju, J.K. Park, C. Stein, Long tours and short superstrings (preliminary version), in: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), 1994, pp. 166\u2013177","DOI":"10.1109\/SFCS.1994.365696"},{"key":"10.1016\/S0890-5401(03)00060-9_BIB13","first-page":"445","article-title":"Sequencing and scheduling: algorithms and complexity","volume":"vol. 4","author":"Lawler","year":"1993"},{"key":"10.1016\/S0890-5401(03)00060-9_BIB14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocation and sequencing problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Science"},{"key":"10.1016\/S0890-5401(03)00060-9_BIB15","series-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"1995"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000609?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103000609?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T23:56:35Z","timestamp":1553212595000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540103000609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0890540103000609"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(03)00060-9","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}