{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T13:14:06Z","timestamp":1712495646835},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T00:00:00Z","timestamp":1234224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s10951-009-0101-4","type":"journal-article","created":{"date-parts":[[2009,2,9]],"date-time":"2009-02-09T21:04:36Z","timestamp":1234213476000},"page":"389-400","source":"Crossref","is-referenced-by-count":4,"title":["The worst-case analysis of the Garey\u2013Johnson algorithm"],"prefix":"10.1007","volume":"12","author":[{"given":"Claire","family":"Hanen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yakov","family":"Zinder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,10]]},"reference":[{"key":"101_CR1","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1137\/S0097539790181889","volume":"23","author":"B. Braschi","year":"1994","unstructured":"Braschi, B., & Trystram, D. (1994). A new insight into the Coffman\u2013Graham algorithm. SIAM Journal on Computing, 23, 662\u2013669.","journal-title":"SIAM Journal on Computing"},{"key":"101_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2001","unstructured":"Brucker, P. (2001). Scheduling algorithms (3rd ed.). New York: Springer.","edition":"3"},{"key":"101_CR3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/moor.2.3.275","volume":"2","author":"P. Brucker","year":"1977","unstructured":"Brucker, P., Garey, M. R., & Johnson, D. S. (1977). Scheduling equal-length tasks under tree-like precedence constraints to minimise maximum lateness. Mathematics of Operations Research, 2, 275\u2013284.","journal-title":"Mathematics of Operations Research"},{"key":"101_CR4","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0206029","volume":"6","author":"M. R. Garey","year":"1977","unstructured":"Garey, M. R., & Johnson, D. S. (1977). Two-processor scheduling with start-time and deadlines. SIAM Journal on Computing, 6, 416\u2013426.","journal-title":"SIAM Journal on Computing"},{"key":"101_CR5","volume-title":"The worst-case analysis of the Garey\u2013Johnson algorithm for preemptive tasks on m processors","author":"C. Hanen","year":"2005","unstructured":"Hanen, C., & Zinder, Y. (2005). The worst-case analysis of the Garey\u2013Johnson algorithm for preemptive tasks on m processors. New York: MISTA."},{"key":"101_CR6","unstructured":"Hanen, C., & Zinder, Y. (2008). The worst-case analysis of the Garey\u2013Johnson algorithm (Technical report LIP6 2008\/002)."},{"key":"101_CR7","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"J. K. Lenstra","year":"1978","unstructured":"Lenstra, J. K., & Rinnooy Kan, A. H. G. (1978). Complexity of scheduling under precedence constraints. Operations Research, 26, 22\u201335.","journal-title":"Operations Research"},{"key":"101_CR8","first-page":"101","volume":"17","author":"G. Singh","year":"2000","unstructured":"Singh, G., & Zinder, Y. (2000). Worst-case performance of two critical path type algorithms. Asia Pacific Journal of Operational Research, 17, 101\u2013122.","journal-title":"Asia Pacific Journal of Operational Research"},{"key":"101_CR9","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J. D. Ullman","year":"1975","unstructured":"Ullman, J. D. (1975). NP-complete scheduling problems. Journal of Computer and System Sciences, 10, 384\u2013393.","journal-title":"Journal of Computer and System Sciences"},{"key":"101_CR10","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/S0377-2217(02)00770-1","volume":"149","author":"Y. Zinder","year":"2003","unstructured":"Zinder, Y. (2003). An iterative algorithm for scheduling UET tasks with due dates and release times. European Journal of Operational Research, 149, 404\u2013416.","journal-title":"European Journal of Operational Research"},{"key":"101_CR11","unstructured":"Zinder, Y., & Roper, D. (1995). A minimax combinatorial optimisation problem on an acyclic directed graph: polynomial-time algorithms and complexity. In Proceedings of the A.C. Aitken centenary conference, Dunedin (pp. 391\u2013400)."},{"key":"101_CR12","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1018917426360","volume":"81","author":"Y. Zinder","year":"1998","unstructured":"Zinder, Y., & Roper, D. (1998). An iterative algorithm for scheduling unit-time operations with precedence constraints to minimise the maximum lateness. Annals of Operations Research, 81, 321\u2013340.","journal-title":"Annals of Operations Research"},{"key":"101_CR13","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1142\/S0217595905000662","volume":"22","author":"Y. Zinder","year":"2005","unstructured":"Zinder, Y., & Singh, G. (2005). Preemptive scheduling on parallel processors with due dates. Asia Pacific Journal of Operational Research, 22, 445\u2013462.","journal-title":"Asia Pacific Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0101-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0101-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0101-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:42Z","timestamp":1559468382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0101-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,10]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["101"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0101-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,10]]}}}