{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:46:13Z","timestamp":1767339973524},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_11","type":"book-chapter","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T01:40:34Z","timestamp":1441071634000},"page":"118-129","source":"Crossref","is-referenced-by-count":7,"title":["Towards Tight Lower Bounds for Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Abbas","family":"Bazzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashkan","family":"Norouzi-Fard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"11_CR1","first-page":"453","volume-title":"Proc. FOCS 2009, FOCS 2009","author":"N. Bansal","year":"2009","unstructured":"Bansal, N., Khot, S.: Optimal long code test with one free bit. In: Proc. FOCS 2009, FOCS 2009, pp. 453\u2013462. IEEE Computer Society, Washington, DC (2009)"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/jagm.2001.1184","volume":"41","author":"C. Chekuri","year":"2001","unstructured":"Chekuri, C., Bender, M.: An efficient approximation algorithm for minimizing makespan on uniformly related machines. Journal of Algorithms\u00a041(2), 212\u2013224 (2001)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1006\/jagm.1998.0987","volume":"30","author":"F.A. Chudak","year":"1999","unstructured":"Chudak, F.A., Shmoys, D.B.: Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. Journal of Algorithms\u00a030(2), 323\u2013343 (1999)","journal-title":"Journal of Algorithms"},{"issue":"7","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1016\/j.jcss.2008.04.001","volume":"74","author":"D. Gangal","year":"2008","unstructured":"Gangal, D., Ranade, A.: Precedence constrained scheduling in (2-7\/(3p+1)) optimal. Journal of Computer and System Sciences\u00a074(7), 1139\u20131146 (2008)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/322186.322194","volume":"27","author":"T.F. Gonzalez","year":"1980","unstructured":"Gonzalez, T.F., Johnson, D.B.: A new algorithm for preemptive scheduling of trees. Journal of the ACM (JACM)\u00a027(2), 287\u2013312 (1980)","journal-title":"Journal of the ACM (JACM)"},{"issue":"9","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal\u00a045(9), 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics\u00a05(2), 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM (JACM)\u00a034(1), 144\u2013162 (1987)","journal-title":"Journal of the ACM (JACM)"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing\u00a017(3), 539\u2013551 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","volume":"4","author":"J.K. Lenstra","year":"1979","unstructured":"Lenstra, J.K., Kan, A.R.: Computational complexity of discrete optimization problems. Annals of Discrete Mathematics\u00a04, 121\u2013140 (1979)","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R.: Scheduling with deadlines and loss functions. Management Science\u00a06(1), 1\u201312 (1959)","journal-title":"Management Science"},{"issue":"11","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1109\/T-C.1969.222573","volume":"100","author":"R.R. Muntz","year":"1969","unstructured":"Muntz, R.R., Coffman Jr., E.G.: Optimal preemptive scheduling on two-processor systems. IEEE Transactions on Computers\u00a0100(11), 1014\u20131020 (1969)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/321574.321586","volume":"17","author":"R.R. Muntz","year":"1970","unstructured":"Muntz, R.R., Coffman Jr., E.G.: Preemptive scheduling of real-time tasks on multiprocessor systems. Journal of the ACM (JACM)\u00a017(2), 324\u2013338 (1970)","journal-title":"Journal of the ACM (JACM)"},{"issue":"5","key":"11_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<203::AID-JOS26>3.0.CO;2-5","volume":"2","author":"P. Schuurman","year":"1999","unstructured":"Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling\u00a02(5), 203\u2013213 (1999)","journal-title":"Journal of Scheduling"},{"issue":"5","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1137\/100810502","volume":"40","author":"O. Svensson","year":"2011","unstructured":"Svensson, O.: Hardness of precedence constrained scheduling on identical machines. SIAM Journal on Computing\u00a040(5), 1258\u20131274 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR16","unstructured":"Ullman, J.D.: Complexity of sequencing problems. In: Coman Jr., E.G. (ed.) Computer and Job-Shop Scheduling Theory (1976)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The design of approximation algorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T15:51:26Z","timestamp":1691941886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}