{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T20:24:25Z","timestamp":1743452665851},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_45","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"530-542","source":"Crossref","is-referenced-by-count":9,"title":["On the Configuration-LP for Scheduling on Unrelated Machines"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Verschae","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Wiese","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/978-3-540-85363-3_2","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"A. Asadpour","year":"2008","unstructured":"Asadpour, A., Feige, U., Saberi, A.: Santa claus meets hypergraph matchings. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 10\u201320. Springer, Heidelberg (2008)"},{"key":"45_CR2","unstructured":"Asadpour, A., Feige, U., Saberi, A.: Santa claus meets hypergraph matchings. Technical report, Standford University (2009), Available for download at \n                    \n                      http:\/\/www.stanford.edu\/~asadpour\/publication.htm"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. In: Proceedings of the 39th annual ACM symposium on Theory of computing (STOC 2007), pp. 114\u2013121 (2007)","DOI":"10.1145\/1250790.1250808"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The santa claus problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC 2006), pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Bateni, M., Charikar, M., Guruswami, V.: Maxmin allocation via degree lower-bounded arborescences. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC 2009), pp. 543\u2013552 (2009)","DOI":"10.1145\/1536414.1536488"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Chuzhoy, J., Khanna, S.: On allocating goods to maximize fairness. In: Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS 2009), pp. 107\u2013116 (2009)","DOI":"10.1109\/FOCS.2009.51"},{"key":"45_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-03685-9_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"J.R. Correa","year":"2009","unstructured":"Correa, J.R., Skutella, M., Verschae, J.: The power of preemption on unrelated machines and applications to scheduling orders. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol.\u00a05687, pp. 84\u201397. Springer, Heidelberg (2009)"},{"key":"45_CR8","unstructured":"Ebenlendr, T., Kr\u010d\u00e1l, M., Sgall, J.: Graph balancing: a special case of scheduling unrelated parallel machines. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 483\u2013490 (2008)"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Palvoelgyi, D., Rothvoss, T.: Bin packing via discrepancy of permutations. In: Proceedings of the 22th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 476\u2013481 (2011)","DOI":"10.1137\/1.9781611973082.38"},{"key":"45_CR10","unstructured":"Feige, U.: On allocations that maximize fairness. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 287\u2013293 (2008)"},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2007.02.056","volume":"380","author":"M. Gairing","year":"2007","unstructured":"Gairing, M., Monien, B., Woclaw, A.: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theoretical Computer Science\u00a0380, 87\u201399 (2007)","journal-title":"Theoretical Computer Science"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Saha, B., Srinivasan, A.: New constructive aspects of the lovasz local lemma. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 397\u2013406 (2010)","DOI":"10.1109\/FOCS.2010.45"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 1982), pp. 312\u2013320 (1982)","DOI":"10.1109\/SFCS.1982.61"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/322092.322101","volume":"25","author":"E.L. Lawler","year":"1978","unstructured":"Lawler, E.L., Labetoulle, J.: On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM\u00a025, 612\u2013619 (1978)","journal-title":"Journal of the ACM"},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ipl.2009.09.015","volume":"110","author":"K. Lee","year":"2009","unstructured":"Lee, K., Leung, J.Y., Pinedo, M.L.: A note on graph balancing problems with restrictions. Information Processing Letters\u00a0110, 24\u201329 (2009)","journal-title":"Information Processing Letters"},{"key":"45_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046, 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"key":"45_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.ijpe.2008.09.003","volume":"116","author":"J.Y. Leung","year":"2008","unstructured":"Leung, J.Y., Li, C.: Scheduling with processing set restrictions: A survey. International Journal of Production Economics\u00a0116, 251\u2013262 (2008)","journal-title":"International Journal of Production Economics"},{"key":"45_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0377-2217(02)00914-1","volume":"156","author":"Y. Lin","year":"2004","unstructured":"Lin, Y., Li, W.: Parallel machine scheduling of machine-dependent jobs with unit-length. European Journal of Operational Research\u00a0156, 261\u2013266 (2004)","journal-title":"European Journal of Operational Research"},{"key":"45_CR19","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0167-6377(96)00047-8","volume":"20","author":"G. Scheithauer","year":"1997","unstructured":"Scheithauer, G., Terno, J.: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem. Operations Research Letters\u00a020, 93\u2013100 (1997)","journal-title":"Operations Research Letters"},{"key":"45_CR20","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, 203\u2013213 (1999)","journal-title":"Journal of Scheduling"},{"key":"45_CR21","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.orl.2004.05.004","volume":"33","author":"E.V. Shchepin","year":"2005","unstructured":"Shchepin, E.V., Vakhania, N.: An optimal rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters\u00a033, 127\u2013133 (2005)","journal-title":"Operations Research Letters"},{"key":"45_CR22","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D.B. Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, E.: An approximation algorithm for the generalized assignment problem. Mathematical Programming\u00a062, 461\u2013474 (1993)","journal-title":"Mathematical Programming"},{"key":"45_CR23","doi-asserted-by":"crossref","unstructured":"Svensson, O.: Santa claus schedules jobs on unrelated machines. In: Proceedings of the 43th Annual ACM Symposium on Theory of Computing, STOC 2011 (2011) (to appear)","DOI":"10.1145\/1993636.1993718"},{"key":"45_CR24","unstructured":"Verschae, J., Wiese, A.: On the configuration-LP for scheduling on unrelated machines. Technical Report 025-2010, Technische Universit\u00e4t Berlin (November 2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T16:02:24Z","timestamp":1554134544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}