{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:16:49Z","timestamp":1725484609818},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424932"},{"type":"electronic","value":"9783540446767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44676-1_16","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T12:43:15Z","timestamp":1179492195000},"page":"194-205","source":"Crossref","is-referenced-by-count":19,"title":["A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs"],"prefix":"10.1007","author":[{"given":"Eric","family":"Angel","sequence":"first","affiliation":[]},{"given":"Evripidis","family":"Bampis","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Kononov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"I. Baldine and G. Rouskas. Dynamic load-balancing in broadcast WDM networks with tuning latencies. In Proc. IEEE InfoCom\u201998, pages 78\u201385, 1998.","DOI":"10.1109\/INFCOM.1998.659640"},{"key":"16_CR2","unstructured":"E. Bampis, S. Chaoui, and S. Vial. On the performance of LPT with lookahead for the reconfiguration of WDM all optical networks. In OptiComm\u20192000, Proc. SPIE Vol. 4233, pages 141\u2013152, 2000."},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y. Bartal","year":"2000","unstructured":"Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stougie. Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics, 13(1):64\u201378, 2000.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0167-6377(83)90035-4","volume":"2","author":"J.F. Benders","year":"1982","unstructured":"J.F. Benders and J.A.E.E. van Nunen. A property of assignment type mixed integer linear programming problems. Operations Research Letters, 2:47\u201352, 1982.","journal-title":"Operations Research Letters"},{"key":"16_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-48481-7_14","volume-title":"Approximation schemes for scheduling on uniformly related and identical parallel machines","author":"L. Epstein","year":"1999","unstructured":"L. Epstein and J. Sgall. Approximation schemes for scheduling on uniformly related and identical parallel machines. In ESA, Lecture Notes in Computer Science 1643, pages 151\u2013162, 1999."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher and R. Jaikumar. A generalized assignment heuristic for vehicle routing. Networks, 11:109\u2013124, 1981.","journal-title":"Networks"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"21","author":"M.D. Grigoriadis","year":"1996","unstructured":"M.D. Grigoriadis and L.G. Khachiyan. Coordination complexity of parallel price-directive decomposition. Mathematics of Operations Research, 21:321\u2013340, 1996.","journal-title":"Mathematics of Operations Research"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"P. Hansen. Bicriterion path problems. In Proc. 3d Conf. Multiple Criteria Decision Making, Theory and application, pages 109\u2013127. Springer-Verlag, 1979. LNEMS, 177.","DOI":"10.1007\/978-3-642-48782-8_9"},{"key":"16_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-45253-2_25","volume-title":"Preemptive scheduling with rejection","author":"H. Hoogeveen","year":"2000","unstructured":"H. Hoogeveen, M. Skutella, and G.J. Woeginger. Preemptive scheduling with rejection. In ESA, Lecture Notes in Computer Science 1879, pages 268\u2013277, 2000."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"E. Horowitz and S. Sahni. Exact and approximate algorithms for scheduling non identical processors. Journal of the Association for Computing Machinery, 23:317\u2013327, 1976.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"16_CR11","unstructured":"C.D. Jacobs. The vehicle routing problem with backhauls. PhD thesis, Georgia Institute of Technology, 1987."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"K. Jansen and L. Porkolab. Improved approximation schemes for scheduling unrelated parallel machines. In STOC\u201999, pages 408\u2013417, 1999.","DOI":"10.1145\/301250.301361"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"J.K. Lenstra, D.B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming A, 46:259\u2013271, 1990.","journal-title":"Mathematical Programming A"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"J.-H. Lin and J.S. Vitter. \u03b5-approximation algorithms with minimum packing constraint violation. In STOC\u201992, pages 771\u2013782, 1992.","DOI":"10.1145\/129712.129787"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"C.H. Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access of web sources. In FOCS\u20192000, pages 86\u201392, 2000.","DOI":"10.1109\/SFCS.2000.892068"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/mnsc.24.3.345","volume":"24","author":"G.T. Ross","year":"1977","unstructured":"G.T. Ross and R.M. Soland. A branch and bound algorithm for the generalized assignment problem. Management Science, 24:345\u2013357, 1977.","journal-title":"Management Science"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D.B. Shmoys","year":"1993","unstructured":"D.B. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming A, 62:461\u2013474, 1993.","journal-title":"Mathematical Programming A"},{"key":"16_CR18","unstructured":"M.A. Trick. Scheduling multiple variable-speed machines. In 1st Conference of Integer Programming and Combinatorial Optimization, pages 485\u2013494, 1990."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44676-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:44:02Z","timestamp":1556412242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44676-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424932","9783540446767"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44676-1_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}