{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:10:10Z","timestamp":1746295810163,"version":"3.40.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_48","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"559-571","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling over Scenarios on Two Machines"],"prefix":"10.1007","author":[{"given":"Esteban","family":"Feuerstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frans","family":"Schalekamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Sitters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suzanne","family":"van der Ster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anke","family":"van Zuylen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation: Combinatorial optimization problems and their approximability properties. Springer (1999)","DOI":"10.1007\/978-3-642-58412-1"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Austrin, P., Guruswami, V., H\u00e5stad, J.: (2 + \u03b5)-SAT is NP-hard. Electronic Colloquium on Computational Complexity, TR13-159 (2013)","DOI":"10.1109\/FOCS.2014.9"},{"issue":"3","key":"48_CR3","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A. Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust optimization\u2013methodology and applications. Mathematical Programming\u00a092(3), 453\u2013480 (2002)","journal-title":"Mathematical Programming"},{"issue":"1","key":"48_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2012.06.025","volume":"64","author":"Z. Bouyahia","year":"2013","unstructured":"Bouyahia, Z., Bellalouna, M., Ghedira, K.: Load balancing a priori strategy for the probabilistic weighted flowtime problem. Comput. Ind. Eng.\u00a064(1), 1\u201310 (2013)","journal-title":"Comput. Ind. Eng."},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Bouyahia, Z., Bellalouna, M., Jaillet, P., Ghedira, K.: A priori parallel machines scheduling. Comput. Ind. Eng.\u00a058(3), 488\u2013500 (2010), Supply, Production and Distribution Systems","DOI":"10.1016\/j.cie.2009.11.009"},{"issue":"4","key":"48_CR6","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1137\/S0097539799356265","volume":"33","author":"C. Chekuri","year":"2004","unstructured":"Chekuri, C., Khanna, S.: On multidimensional packing problems. SIAM Journal on Computing\u00a033(4), 837\u2013851 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1137\/110844210","volume":"41","author":"L. Epstein","year":"2012","unstructured":"Epstein, L., Levin, A., Marchetti-Spaccamela, A., Megow, N., Mestre, J., Skutella, M., Stougie, L.: Universal sequencing on an unreliable machine. SIAM Journal on Computing\u00a041, 565\u2013586 (2012)","journal-title":"SIAM Journal on Computing"},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Feuerstein, E., Marchetti-Spaccamela, A., Schalekamp, F., Sitters, R., van der Ster, S., Stougie, L., van Zuylen, A.: Scheduling over scenarios on two machines. CoRR, abs\/1404.4766 (2014)","DOI":"10.1007\/978-3-319-08783-2_48"},{"key":"48_CR9","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"issue":"6","key":"48_CR10","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM\u00a042(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"issue":"5","key":"48_CR11","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1137\/080732250","volume":"40","author":"A. Gupta","year":"2011","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Sampling and cost-sharing: Approximation algorithms for stochastic optimization problems. SIAM Journal on Computing\u00a040(5), 1361\u20131401 (2011)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"48_CR12","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"issue":"6","key":"48_CR13","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1287\/opre.36.6.929","volume":"36","author":"P. Jaillet","year":"1988","unstructured":"Jaillet, P.: A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res.\u00a036(6), 929\u2013936 (1988)","journal-title":"Oper. Res."},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Karloff, H.J., Zwick, U.: A 7\/8-approximation algorithm for MAX 3SAT? In: FOCS, pp. 406\u2013415. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646129"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of 34th Annual ACM Symposium on Theory of Computing, pp. 767\u2013775 (2002)","DOI":"10.1145\/509907.510017"},{"issue":"1","key":"48_CR16","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S. Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput.\u00a037(1), 319\u2013357 (2007)","journal-title":"SIAM J. Comput."},{"issue":"1-3","key":"48_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.dam.2002.07.001","volume":"142","author":"J. Zhang","year":"2004","unstructured":"Zhang, J., Ye, Y., Han, Q.: Improved approximations for max set splitting and max NAE SAT. Discrete Applied Mathematics\u00a0142(1-3), 133\u2013149 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"Zwick, U.: Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. In: STOC, pp. 679\u2013687 (1999)","DOI":"10.1145\/301250.301431"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:49:07Z","timestamp":1746294547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}