{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:21Z","timestamp":1794381081294,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_56","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"658-669","source":"Crossref","is-referenced-by-count":8,"title":["Improved Results for Data Migration and Open Shop Scheduling"],"prefix":"10.1007","author":[{"given":"Rajiv","family":"Gandhi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guy","family":"Kortsarz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hadas","family":"Shachnai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"56_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-44688-5_12","volume-title":"Algorithm Engineering","author":"E. Anderson","year":"2001","unstructured":"Anderson, E., Hall, J., Hartline, J., Hobbes, M., et al.: An Experimental Study of Data Migration Algorithms. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol.\u00a02141, pp. 145\u2013158. Springer, Heidelberg (2001)"},{"key":"56_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/inco.1997.2677","volume":"140","author":"A. Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Bellare, M., Halld\u00f3rsson, M.M., Shachnai, H., Tamir, T.: On Chromatic Sums and Distributed Resource Allocation. Inf. Comput.\u00a0140, 183\u2013202 (1998)","journal-title":"Inf. Comput."},{"key":"56_CR3","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley, Chichester (1998)"},{"key":"56_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1007\/3-540-61440-0_166","volume-title":"Automata, Languages and Programming","author":"S. Chakrabarti","year":"1996","unstructured":"Chakrabarti, S., Phillips, C.A., Schulz, A.S., Shmoys, D.B., Stein, C., Wein, J.: Improved Scheduling Problems For Minsum Criteria. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 646\u2013657. Springer, Heidelberg (1996)"},{"issue":"3","key":"56_CR5","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1137\/0214054","volume":"14","author":"E.G. Coffman","year":"1985","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling File Transfers. SIAM Journal on Computing\u00a014(3), 744\u2013780 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"56_CR6","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. Graham","year":"1966","unstructured":"Graham, R.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Gabow, H., Kariv, O.: Algorithms for edge coloring bipartite graphs and multigraphs. SIAM Journal of Computing\u00a011(1) (February 1992)","DOI":"10.1137\/0211009"},{"key":"56_CR8","unstructured":"Hall, J., Hartline, J., Karlin, A., Saia, J., Wilkes, J.: On Algorithms for Efficient Data Migration. In: 12th SODA, pp. 620\u2013629 (2001)"},{"key":"56_CR9","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"L. Hall","year":"1997","unstructured":"Hall, L., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms. Mathematics of Operations Research\u00a022, 513\u2013544 (1997)","journal-title":"Mathematics of Operations Research"},{"key":"56_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00453-003-1031-8","volume":"37","author":"M.M. Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Sum Coloring Interval Graphs and k-Claw Free Graphs with Applications for Scheduling Dependent Jobs. Algorithmica\u00a037, 187\u2013209 (2003)","journal-title":"Algorithmica"},{"key":"56_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-69346-7_27","volume-title":"Integer Programming and Combinatorial Optimization","author":"H. Hoogeveen","year":"1998","unstructured":"Hoogeveen, H., Schuurman, P., Woeginger, G.: Non-approximability Results For Scheduling Problems with Minsum Criteria. In: Bixby, R.E., Boyd, E.A., R\u00edos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol.\u00a01412, pp. 353\u2013366. Springer, Heidelberg (1998)"},{"key":"56_CR12","doi-asserted-by":"crossref","unstructured":"Khuller, S., Kim, Y., Wan, Y.C.: Algorithms for Data Migration with Cloning. In: 22nd PODS, pp. 27\u201336 (2003)","DOI":"10.1145\/773153.773156"},{"key":"56_CR13","unstructured":"Kim, Y.: Data Migration to Minimize the Average Completion Time. In: 14th SODA, pp. 97\u201398 (2003)"},{"key":"56_CR14","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy-Kan, A.H.G., Shmoys, D.B.: Sequencing and Scheduling: Algorithms and Complexity. In: Graves, S.C., et al. (eds.) Handbooks in Operations Research and Management Science. Logistics of Production and Inventory, vol.\u00a04, pp. 445\u2013522 (1993)","DOI":"10.1016\/S0927-0507(05)80189-6"},{"issue":"3","key":"56_CR15","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/0403035","volume":"3","author":"T. Nishizeki","year":"1990","unstructured":"Nishizeki, T., Kashiwagi, K.: On the 1.1 edge-coloring of multigraphs. SIAM Journal on Discrete Mathematics\u00a03(3), 391\u2013410 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"56_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01581271","volume":"58","author":"M. Queyranne","year":"1993","unstructured":"Queyranne, M.: Structure of a Simple Scheduling Polyhedron. Mathematical Programming\u00a058, 263\u2013285 (1993)","journal-title":"Mathematical Programming"},{"key":"56_CR17","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/S0196-6774(02)00251-1","volume":"45","author":"M. Queyranne","year":"2002","unstructured":"Queyranne, M., Sviridenko, M.: A (2+\u03b5)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. Journal of Algorithms\u00a045, 202\u2013212 (2002)","journal-title":"Journal of Algorithms"},{"key":"56_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/jos.96","volume":"5","author":"M. Queyranne","year":"2002","unstructured":"Queyranne, M., Sviridenko, M.: Approximation Algorithms for Shop Scheduling Problems with Minsum Objective. Journal of Scheduling\u00a05, 287\u2013305 (2002)","journal-title":"Journal of Scheduling"},{"key":"56_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-61310-2_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"A.S. Schulz","year":"1996","unstructured":"Schulz, A.S.: Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-based Heuristics and Lower Bounds. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 301\u2013315. Springer, Heidelberg (1996)"},{"key":"56_CR20","volume-title":"Invited talk at the 12th International Symposium on Mathematical Programming","author":"L. Wolsey","year":"1985","unstructured":"Wolsey, L.: Mixed Integer Programming Formulations for Production Planning and Scheduling Problems. Invited talk at the 12th International Symposium on Mathematical Programming, MIT, Cambridge (1985)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:00Z","timestamp":1605741840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_56","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99859","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}