{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:55Z","timestamp":1725541855673},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108402"},{"type":"electronic","value":"9783642108419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10841-9_27","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T17:14:44Z","timestamp":1260292484000},"page":"292-303","source":"Crossref","is-referenced-by-count":1,"title":["Selfish Scheduling with Setup Times"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Gourv\u00e8s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orestis A.","family":"Telelis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.2140\/pjm.1960.10.381","volume":"10","author":"R.J. Aumann","year":"1960","unstructured":"Aumann, R.J.: Acceptable points in games of perfect information. Pacific Journal of Mathematics\u00a010, 381\u2013417 (1960)","journal-title":"Pacific Journal of Mathematics"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"Proc. STACS","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case Equilibria. In: Proc. STACS. LNCS, vol.\u00a01543, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-540-27836-8_31","volume-title":"Automata, Languages and Programming","author":"G. Christodoulou","year":"2004","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination Mechanisms. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 345\u2013357. Springer, Heidelberg (2004)"},{"issue":"6","key":"27_CR4","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00224-003-1131-5","volume":"36","author":"E. Koutsoupias","year":"2003","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.G.: Approximate Equilibria and Ball Fusion. Theory of Computing Systems\u00a036(6), 683\u2013693 (2003)","journal-title":"Theory of Computing Systems"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. ACM Transactions on Algorithms\u00a03(1) (2007)","DOI":"10.1145\/1186810.1186814"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-73545-8_20","volume-title":"Computing and Combinatorics","author":"G. Christodoulou","year":"2007","unstructured":"Christodoulou, G., Gourv\u00e8s, L., Pascual, F.: Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 187\u2013197. Springer, Heidelberg (2007)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11600930_7","volume-title":"Internet and Network Economics","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Li, L., Mirrokni, V.S., Schulz, A.: Coordination Mechanisms for Selfish Scheduling. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 55\u201369. Springer, Heidelberg (2005)"},{"key":"27_CR8","unstructured":"Azar, Y., Jain, K., Mirrokni, V.S.: (almost) optimal coordination mechanisms for unrelated machine scheduling. In: Proc. ACM-SIAM SODA, pp. 323\u2013332 (2008)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Caragiannis, I.: Efficient coordination mechanisms for unrelated machine scheduling. In: Proc. AMC-SIAM SODA, pp. 815\u2013824 (2009)","DOI":"10.1137\/1.9781611973068.89"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. SAGT","author":"C. Durr","year":"2009","unstructured":"Durr, C., Nguyen, T.K.: Non-clairvoyant Scheduling Games. In: Proc. SAGT. LNCS. Springer, Heidelberg (to appear, 2009)"},{"key":"27_CR11","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. In: Proc. ACM-SIAM SODA, pp. 189\u2013198 (2007)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-79309-0_6","volume-title":"Algorithmic Game Theory","author":"L. Epstein","year":"2008","unstructured":"Epstein, L., van Stee, R.: The Price of Anarchy on Uniformly Related Machines Revisited. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol.\u00a04997, pp. 46\u201357. Springer, Heidelberg (2008)"},{"key":"27_CR13","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1017\/CBO9780511800481.022","volume-title":"Algorithmic Game Theory","author":"B. V\u00f6cking","year":"2007","unstructured":"V\u00f6cking, B.: Selfish Load Balancing. In: Algorithmic Game Theory, ch.\u00a020, pp. 517\u2013542. Cambridge University Press, Cambridge (2007)"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G. Finn","year":"1979","unstructured":"Finn, G., Horowitz, E.: A linear time approximation algorithm for multiprocessor scheduling. BIT\u00a019, 312\u2013320 (1979)","journal-title":"BIT"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/3-540-45535-3_29","volume-title":"Integer Programming and Combinatorial Optimization","author":"P. Schuurman","year":"2001","unstructured":"Schuurman, P., Vredeveld, T.: Performance guarantees of local search for multiprocessor scheduling. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 370\u2013382. Springer, Heidelberg (2001)"},{"key":"27_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","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, Heidelberg (1999)"},{"key":"27_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H.Freeman & Co Ltd., New York (1979)"},{"key":"27_CR18","unstructured":"Schuurman, P., W\u00f6ginger, G.J.: Preemptive scheduling with job-dependent setup times. In: Proc. ACM-SIAM SODA, pp. 759\u2013767 (1999)"},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1137\/0222078","volume":"22","author":"B. Chen","year":"1993","unstructured":"Chen, B.: A better heuristic for preemptive parallel machine scheduling with batch setup times. SIAM Journal on Computing\u00a022, 1303\u20131318 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"27_CR20","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02238747","volume":"49","author":"G.J. W\u00f6ginger","year":"1992","unstructured":"W\u00f6ginger, G.J., Yu, Z.: A heuristic for preemptive scheduling with set-up times. Computing\u00a049(2), 151\u2013158 (1992)","journal-title":"Computing"},{"issue":"3","key":"27_CR21","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. Journal of Scheduling\u00a09(3), 299\u2013310 (2006)","journal-title":"Journal of Scheduling"},{"key":"27_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics with Applications in Computer Science","author":"S. Jukna","year":"2001","unstructured":"Jukna, S.: Extremal Combinatorics with Applications in Computer Science. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10841-9_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:42:29Z","timestamp":1619782949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}