{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:43:31Z","timestamp":1725900211921},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_1","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"1-3","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines"],"prefix":"10.1007","author":[{"given":"Martin","family":"Skutella","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press (2006)","DOI":"10.1515\/9781400841103"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"M.E. Dyer","year":"1990","unstructured":"Dyer, M.E., Wolsey, L.A.: Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics\u00a026, 255\u2013270 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. Journal of Research National Bureau of Standards Section B\u00a069, 125\u2013130 (1965)","journal-title":"Journal of Research National Bureau of Standards Section B"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1137\/S089548019936223X","volume":"15","author":"M.X. Goemans","year":"2002","unstructured":"Goemans, M.X., Queyranne, M., Schulz, A.S., Skutella, M., Wang, Y.: Single machine scheduling with release dates. SIAM Journal on Discrete Mathematics\u00a015, 165\u2013192 (2002)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"L.A. Hall","year":"1997","unstructured":"Hall, L.A., 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"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.1060.0201","volume":"31","author":"N. Megow","year":"2006","unstructured":"Megow, N., Uetz, M., Vredeveld, T.: Models and algorithms for stochastic online scheduling. Mathematics of Operations Research\u00a031(3), 513\u2013525 (2006)","journal-title":"Mathematics of Operations Research"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1145\/331524.331530","volume":"46","author":"R.H. M\u00f6hring","year":"1999","unstructured":"M\u00f6hring, R.H., Schulz, A.S., Uetz, M.: Approximation in stochastic scheduling: The power of LP-based priority policies. Journal of the ACM\u00a046, 924\u2013942 (1999)","journal-title":"Journal of the ACM"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BFb0120909","volume":"13","author":"C.N. Potts","year":"1980","unstructured":"Potts, C.N.: An algorithm for the single machine sequencing problem with precedence constraints. Mathematical Programming Studies\u00a013, 78\u201387 (1980)","journal-title":"Mathematical Programming Studies"},{"key":"1_CR10","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":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-85097-7_42","volume-title":"Combinatorial Optimization and Applications","author":"A.S. Schulz","year":"2008","unstructured":"Schulz, A.S.: Stochastic online scheduling revisited. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol.\u00a05165, pp. 448\u2013457. Springer, Heidelberg (2008)"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/jos.93","volume":"5","author":"A.S. Schulz","year":"2002","unstructured":"Schulz, A.S., Skutella, M.: The power of \u03b1-points in preemptive single machine scheduling. Journal of Scheduling\u00a05, 121\u2013133 (2002)","journal-title":"Journal of Scheduling"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/S0895480199357078","volume":"15","author":"A.S. Schulz","year":"2002","unstructured":"Schulz, A.S., Skutella, M.: Scheduling unrelated machines by randomized rounding. SIAM Journal on Discrete Mathematics\u00a015, 450\u2013469 (2002)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"1_CR14","unstructured":"Skutella, M.: Approximation and randomization in scheduling. PhD thesis, Technische Universit\u00e4t Berlin, Germany (1998)"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/375827.375840","volume":"48","author":"M. Skutella","year":"2001","unstructured":"Skutella, M.: Convex quadratic and semidefinite programming relaxations in scheduling. Journal of the ACM\u00a048, 206\u2013242 (2001)","journal-title":"Journal of the ACM"},{"key":"1_CR16","unstructured":"Skutella, M., Sviridenko, M., Uetz, M.: Stochastic scheduling on unrelated machines (in preparation, 2013)"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1137\/S0097539702415007","volume":"34","author":"M. Skutella","year":"2005","unstructured":"Skutella, M., Uetz, M.: Stochastic machine scheduling with precedence constraints. SIAM Journal on Computing\u00a034, 788\u2013802 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR18","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":"1_CR19","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":"1_CR20","volume-title":"Invited talk at the 12th International Symposium on Mathematical Programming","author":"L.A. Wolsey","year":"1985","unstructured":"Wolsey, L.A.: Mixed integer programming formulations for production planning and scheduling problems. Invited talk at the 12th International Symposium on Mathematical Programming. MIT, Cambridge (1985)"},{"key":"1_CR21","unstructured":"Wolsey, L.A.: Integer Programming. Wiley (1998)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T15:49:13Z","timestamp":1688226553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}