{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:56:32Z","timestamp":1772297792357,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319075563","type":"print"},{"value":"9783319075570","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07557-0_21","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T07:50:30Z","timestamp":1400313030000},"page":"249-260","source":"Crossref","is-referenced-by-count":3,"title":["Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 R.","family":"Correa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jannik","family":"Matuschke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ola","family":"Svensson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00edctor","family":"Verdugo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Verschae","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A. Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C., Cheng, T., Kovalyov, M.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res.\u00a0187, 985\u20131032 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Feige, U., Saberi, A.: Santa claus meets hypergraph matchings. ACM Trans. Algorithms\u00a024, 24:1\u201324:9 (2012)","DOI":"10.1145\/2229163.2229168"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus problem. In: STOC, pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10951-006-8265-7","volume":"9","author":"B. Chen","year":"2006","unstructured":"Chen, B., Ye, Y., Zhang, J.: Lot-sizing scheduling with batch setup times. J. Sched.\u00a09, 299\u2013310 (2006)","journal-title":"J. Sched."},{"key":"21_CR5","unstructured":"Correa, J.R., Verdugo, V., Verschae, J.: Approximation algorithms for scheduling splitting jobs with setup times. In: Talk in MAPSP (2013)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Ebenlendr, T., Kr\u010d\u00e1l, M., Sgall, J.: Graph balancing: A special case of scheduling unrelated parallel machines. Algorithmica (2012), doi:10.1007\/s00453-012-9668-9","DOI":"10.1007\/s00453-012-9668-9"},{"key":"21_CR7","unstructured":"Feige, U.: On allocations that maximize fairness. In: SODA, pp. 287\u2013293 (2008)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math.\u00a05, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Saha, B., Srinivasan, A.: New constructive aspects of the Lov\u00e1sz Local Lemma. J. ACM\u00a058, 28:1\u201328 (2011)","DOI":"10.1145\/2049697.2049702"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0736-5845(02)00077-7","volume":"19","author":"D.-W. Kim","year":"2003","unstructured":"Kim, D.-W., Na, D.-G., Frank Chen, F.: Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robot. Com. -Int. Manuf.\u00a019, 173\u2013181 (2003)","journal-title":"Robot. Com. -Int. Manuf."},{"key":"21_CR11","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. Math. Program.\u00a046, 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/B:JOSH.0000031424.35504.c4","volume":"7","author":"Z. Liu","year":"2004","unstructured":"Liu, Z., Cheng, T.C.E.: Minimizing total completion time subject to job release dates and preemption penalties. J. Sched.\u00a07, 313\u2013327 (2004)","journal-title":"J. Sched."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimiz.\u00a01, 166\u2013190 (1991)","journal-title":"SIAM J. Optimiz."},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/978-3-642-31594-7_61","volume-title":"Automata, Languages, and Programming","author":"L. Polacek","year":"2012","unstructured":"Polacek, L., Svensson, O.: Quasi-polynomial local search for restricted max-min fair allocation. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol.\u00a07391, pp. 726\u2013737. Springer, Heidelberg (2012)"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"C.N. Potts","year":"1992","unstructured":"Potts, C.N., Wassenhove, L.N.V.: Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. J. Oper. Res. Soc.\u00a043, 395\u2013406 (1992)","journal-title":"J. Oper. Res. Soc."},{"key":"21_CR16","unstructured":"Schalekamp, F., Sitters, R., van der Ster, S., Stougie, L., Verdugo, V., van Zuylen, A.: Split scheduling with uniform setup times. Arxiv (2012)"},{"key":"21_CR17","unstructured":"Schuurman, P., Woeginger, G.J.: Preemptive scheduling with job-dependent setup times. In: SODA, pp. 759\u2013767 (1999)"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1287\/opre.44.4.617","volume":"44","author":"P. Serafini","year":"1996","unstructured":"Serafini, P.: Scheduling jobs on several machines with the job splitting property. Oper. Res.\u00a044, 617\u2013628 (1996)","journal-title":"Oper. Res."},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1137\/110851201","volume":"41","author":"O. Svensson","year":"2012","unstructured":"Svensson, O.: Santa claus schedules jobs on unrelated machines. SIAM J. Comput.\u00a041, 1318\u20131341 (2012)","journal-title":"SIAM J. Comput."},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-36694-9_33","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Sviridenko","year":"2013","unstructured":"Sviridenko, M., Wiese, A.: Approximating the configuration-lp for minimizing weighted sum of completion times on unrelated machines. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol.\u00a07801, pp. 387\u2013398. Springer, Heidelberg (2013)"},{"key":"21_CR21","unstructured":"van der Ster, S.: The allocation of scarce resources in disaster relief. MSc-Thesis in Operations Research at VU University Amsterdam (2010)"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-642-23719-5_45","volume-title":"Algorithms \u2013 ESA 2011","author":"J. Verschae","year":"2011","unstructured":"Verschae, J., Wiese, A.: On the configuration-LP for scheduling on unrelated machines. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 530\u2013542. Springer, Heidelberg (2011)"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0166-218X(00)00176-1","volume":"103","author":"W. Xing","year":"2000","unstructured":"Xing, W., Zhang, J.: Parallel machine scheduling with splitting jobs. Discrete Appl. Math.\u00a0103, 259\u2013269 (2000)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07557-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T02:17:00Z","timestamp":1689214620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}