{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:33Z","timestamp":1725558513656},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406716"},{"type":"electronic","value":"9783540451389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_35","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T22:41:48Z","timestamp":1277246508000},"page":"408-418","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Schemes for the Min-Max Starting Time Problem"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamir","family":"Tassa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"35_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., et al.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling\u00a01(1), 55\u201366 (1998)","journal-title":"Journal of Scheduling"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-45749-6_41","volume-title":"Algorithms - ESA 2002","author":"L. Epstein","year":"2002","unstructured":"Epstein, L., van Stee, R.: Minimizing the maximum starting time on-line. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 449\u2013460. Springer, Heidelberg (2002)"},{"key":"35_CR3","doi-asserted-by":"crossref","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 multiprocessor anomalies. Bell System Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math\u00a017, 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math"},{"issue":"3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D. Hochbaum","year":"1988","unstructured":"Hochbaum, D., Shmoys, D.: 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"},{"issue":"1","key":"35_CR6","doi-asserted-by":"crossref","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 Association for Computing Machinery\u00a034(1), 144\u2013162 (1987)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"35_CR7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. Journal of the Association for Computing Machinery\u00a023, 317\u2013327 (1976)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","first-page":"408","volume-title":"Analysis of Dynamical and Cognitive Systems","author":"K. Jansen","year":"1999","unstructured":"Jansen, K., Porkolab, L.: Improved approximation schemes for scheduling unrelated parallel machines. In: Andersson, S.I. (ed.) Summer University of Southern Stockholm 1993. LNCS, vol.\u00a0888, pp. 408\u2013417. Springer, Heidelberg (1999)"},{"key":"35_CR9","doi-asserted-by":"publisher","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.: Complexity os scheduling under precedence constraints. Operations Research\u00a026, 22\u201335 (1978)","journal-title":"Operations Research"},{"key":"35_CR10","first-page":"846","volume":"21","author":"S.R. Mehta","year":"1975","unstructured":"Mehta, S.R., Chandrasekaran, R., Emmons, H.: Order-presrving allocation of jobs to two machines. Naval Research Logistics Quarterly\u00a021, 846\u2013847 (1975)","journal-title":"Naval Research Logistics Quarterly"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","first-page":"77","volume-title":"Algorithms - ESA\u201999","author":"J. Naor","year":"1999","unstructured":"Naor, J., Bar-Noy, A., Freund, A.: On-line load balancing in a hierarchical server topology. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 77\u201388. Springer, Heidelberg (1999)"},{"key":"35_CR12","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S.: Algorithms for scheduling independent tasks. Journal of the Association for Computing Machinery\u00a023, 116\u2013127 (1976)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"35_CR13","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.: Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling\u00a02, 203\u2013213 (1999)","journal-title":"Journal of Scheduling"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T01:16:42Z","timestamp":1552612602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}