{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:02Z","timestamp":1725558362598},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405450"},{"type":"electronic","value":"9783540450788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45078-8_6","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T17:23:52Z","timestamp":1277227432000},"page":"59-66","source":"Crossref","is-referenced-by-count":6,"title":["Common-Deadline Lazy Bureaucrat Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Behdad","family":"Esfahbod","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Sharifi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-48447-7_14","volume-title":"Algorithms and Data Structures","author":"E.M. Arkin","year":"1999","unstructured":"Arkin, E.M., Bender, M.A., Mitchell, J.S.B., Skiena, S.S.: The lazy bureaucrat scheduling problem. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 122\u2013133. Springer, Heidelberg (1999)"},{"key":"6_CR2","volume-title":"Computers and intractability, a guide to the theory of NP-completeness","author":"M.R. Gary","year":"1979","unstructured":"Gary, M.R., Johnson, D.S.: Computers and intractability, a guide to the theory of NP-completeness. W. H. Freeman and Company, New York (1979)"},{"key":"6_CR3","unstructured":"Farzan, A., Ghodsi, M.: New results for lazy bureaucrat scheduling problem. In: 7th CSI Computer Conference (CSICC 2002), Iran Telecommunication Research Center, March 3\u20135, pp. 66\u201371 (2002)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-45471-3_5","volume-title":"Algorithm Theory - SWAT 2002","author":"C. Hepner","year":"2002","unstructured":"Hepner, C., Stein, C.: Minimizing makespan for the lazy bureaucrat problem. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 40\u201350. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45078-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T20:55:23Z","timestamp":1552596923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45078-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405450","9783540450788"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45078-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}