{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:47Z","timestamp":1725543467850},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_15","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"136-147","source":"Crossref","is-referenced-by-count":12,"title":["Decentralization and Mechanism Design for Online Machine Scheduling"],"prefix":"10.1007","author":[{"given":"Birgit","family":"Heydenreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rudolf","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Uetz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","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. Ann. Discr. Math.\u00a05, 287\u2013326 (1979)","journal-title":"Ann. Discr. Math."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra, J.K., Rinnoy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. of Discr. Math.\u00a01, 343\u2013362 (1977)","journal-title":"Ann. of Discr. Math."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-61310-2_30","volume-title":"Integer Programming and Combinatorial Optimization","author":"J.A. Hoogeveen","year":"1996","unstructured":"Hoogeveen, J.A., Vestjens, A.P.A.: Optimal on-line algorithms for single machine scheduling. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 404\u2013414. Springer, Heidelberg (1996)"},{"key":"15_CR4","unstructured":"Vestjens, A.P.A.: On-line Machine Scheduling. PhD thesis, Eindhoven University of Technology, Eindhoven, The Netherlands (1997)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1287\/moor.1040.0092","volume":"29","author":"E.J. Anderson","year":"2004","unstructured":"Anderson, E.J., Potts, C.N.: Online scheduling of a single machine to minimize total weighted completion time. Math. Oper. Res.\u00a029, 686\u2013697 (2004)","journal-title":"Math. Oper. Res."},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11496915_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"J.R. Correa","year":"2005","unstructured":"Correa, J.R., Wagner, M.R.: LP-based online scheduling: from single to parallel machines. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 196\u2013209. Springer, Heidelberg (2005)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.orl.2003.11.008","volume":"32","author":"N. Megow","year":"2004","unstructured":"Megow, N., Schulz, A.S.: On-line scheduling to minimize average completion time revisited. Oper. Res. Letters\u00a032, 485\u2013490 (2004)","journal-title":"Oper. Res. Letters"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Megow, N., Uetz, M., Vredeveld, T.: Models and algorithms for stochastic online scheduling. Math. Oper. Res. (to appear)","DOI":"10.1287\/moor.1060.0201"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W. Smith","year":"1956","unstructured":"Smith, W.: Various optimizers for single stage production. Nav. Res. Log. Quarterly\u00a03, 59\u201366 (1956)","journal-title":"Nav. Res. Log. Quarterly"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behavior\u00a035, 166\u2013196 (2001)","journal-title":"Games and Economic Behavior"},{"key":"15_CR11","first-page":"482","volume-title":"Proc. 42nd FOCS","author":"A. Archer","year":"2001","unstructured":"Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: Proc. 42nd FOCS, pp. 482\u2013491. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/11561071_55","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Kovacs","year":"2005","unstructured":"Kovacs, A.: Fast monotone 3-approximation algorithm for scheduling related machines. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 616\u2013627. Springer, Heidelberg (2005)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/988772.988783","volume-title":"Proc. 5th ACM Conf. Electronic Commerce","author":"R. Porter","year":"2004","unstructured":"Porter, R.: Mechanism design for online real-time scheduling. In: Proc. 5th ACM Conf. Electronic Commerce, pp. 61\u201370. ACM Press, New York (2004)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1287\/mnsc.11.2.268","volume":"11","author":"W.L. Eastman","year":"1964","unstructured":"Eastman, W.L., Even, S., Isaacs, I.M.: Bounds for the optimal scheduling of n jobs on m processors. Management Science\u00a011, 268\u2013279 (1964)","journal-title":"Management Science"},{"key":"15_CR15","first-page":"574","volume-title":"Proc. 44th FOCS","author":"R. Lavi","year":"2003","unstructured":"Lavi, R., Mu\u2019alem, A., Nisan, N.: Towards a characterization of truthful combinatorial auctions. In: Proc. 44th FOCS, pp. 574\u2013583. IEEE Computer Society Press, Los Alamitos (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:13Z","timestamp":1619507953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11785293_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}