{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T10:44:50Z","timestamp":1760438690889},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,10,24]],"date-time":"2014-10-24T00:00:00Z","timestamp":1414108800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10107-014-0831-8","type":"journal-article","created":{"date-parts":[[2014,10,23]],"date-time":"2014-10-23T15:24:32Z","timestamp":1414077872000},"page":"305-328","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Strong LP formulations for scheduling splittable jobs on unrelated machines"],"prefix":"10.1007","volume":"154","author":[{"given":"Jos\u00e9","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","published-online":{"date-parts":[[2014,10,24]]},"reference":[{"key":"831_CR1","doi-asserted-by":"crossref","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. 187, 985\u20131032 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"831_CR2","doi-asserted-by":"crossref","first-page":"24:1","DOI":"10.1145\/2229163.2229168","volume":"8","author":"A Asadpour","year":"2012","unstructured":"Asadpour, A., Feige, U., Saberi, A.: Santa claus meets hypergraph matchings. ACM Trans. Algorithms 8, 24:1\u201324:9 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"831_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":"831_CR4","doi-asserted-by":"crossref","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. 9, 299\u2013310 (2006)","journal-title":"J. Sched."},{"key":"831_CR5","unstructured":"Correa, J.R., Verdugo, V., Verschae, J.: Approximation algorithms for scheduling splitting jobs with setup times (2013). Talk in MAPSP"},{"key":"831_CR6","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/s00453-012-9668-9","volume":"68","author":"T Ebenlendr","year":"2014","unstructured":"Ebenlendr, T., Kr\u010d\u00e1l, M., Sgall, J.: Graph balancing: a special case of scheduling unrelated parallel machines. Algorithmica 68, 62\u201380 (2014)","journal-title":"Algorithmica"},{"key":"831_CR7","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of $$\\log (n)$$ log ( n ) for approximating set cover. J. ACM 45, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"831_CR8","unstructured":"Feige, U.: On allocations that maximize fairness. In: SODA, pp. 287\u2013293 (2008)"},{"key":"831_CR9","doi-asserted-by":"crossref","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. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"831_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)"},{"issue":"28","key":"831_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2049697.2049702","volume":"58","author":"B Haeupler","year":"2011","unstructured":"Haeupler, B., Saha, B., Srinivasan, A.: New constructive aspects of the Lov\u00e1sz local lemma. J. ACM 58(28), 1\u201328 (2011)","journal-title":"J. ACM"},{"key":"831_CR12","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22, 463\u2013468 (1975)","journal-title":"J. ACM"},{"key":"831_CR13","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0736-5845(02)00077-7","volume":"19","author":"DW 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. Comut. Integr. Manuf. 19, 173\u2013181 (2003)","journal-title":"Robot. Comut. Integr. Manuf."},{"key":"831_CR14","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"831_CR15","doi-asserted-by":"crossref","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. 7, 313\u2013327 (2004)","journal-title":"J. Sched."},{"key":"831_CR16","doi-asserted-by":"crossref","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\u20131 optimization. SIAM J. Optimiz. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optimiz."},{"key":"831_CR17","doi-asserted-by":"crossref","unstructured":"Polacek, L., Svensson, O.: Quasi-polynomial local search for restricted max-min fair allocation. In: ICALP, pp. 726\u2013737 (2012)","DOI":"10.1007\/978-3-642-31594-7_61"},{"key":"831_CR18","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"CN 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. 43, 395\u2013406 (1992)","journal-title":"J. Oper. Res. Soc."},{"key":"831_CR19","doi-asserted-by":"crossref","unstructured":"Schalekamp, F., Sitters, R., van der Ster, S., Stougie, L., Verdugo, V., van Zuylen, A.: Split scheduling with uniform setup times. J. Sched. 1\u201311 (2014). doi: 10.1007\/s10951-014-0370-4","DOI":"10.1007\/s10951-014-0370-4"},{"key":"831_CR20","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"key":"831_CR21","unstructured":"Schuurman, P., Woeginger, G.J.: Preemptive scheduling with job-dependent setup times. In: SODA, pp. 759\u2013767 (1999)"},{"key":"831_CR22","doi-asserted-by":"crossref","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. 44, 617\u2013628 (1996)","journal-title":"Oper. Res."},{"key":"831_CR23","doi-asserted-by":"crossref","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. 41, 1318\u20131341 (2012)","journal-title":"SIAM J. Comput."},{"key":"831_CR24","first-page":"387","volume":"2013","author":"M Sviridenko","year":"2013","unstructured":"Sviridenko, M., Wiese, A.: Approximating the configuration-lp for minimizing weighted sum of completion times on unrelated machines. IPCO 2013, 387\u2013398 (2013)","journal-title":"IPCO"},{"key":"831_CR25","unstructured":"van der Ster, S.: The allocation of scarce resources in disaster relief (2010). MSc-Thesis in Operations Research at VU University Amsterdam"},{"key":"831_CR26","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10951-013-0359-4","volume":"7","author":"J Verschae","year":"2014","unstructured":"Verschae, J., Wiese, A.: On the configuration-LP for scheduling on unrelated machines. J. Sched. 7, 371\u2013383 (2014)","journal-title":"J. Sched."},{"key":"831_CR27","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"},{"key":"831_CR28","doi-asserted-by":"crossref","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. 103, 259\u2013269 (2000)","journal-title":"Discrete Appl. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0831-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0831-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0831-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:06Z","timestamp":1559124006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0831-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,24]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["831"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0831-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,24]]}}}