乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:28Z","timestamp":1725489808283},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73951-7_31","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:18:03Z","timestamp":1187605083000},"page":"349-361","source":"Crossref","is-referenced-by-count":2,"title":["On the Robustness of Graham\u2019s Algorithm for Online Scheduling"],"prefix":"10.1007","author":[{"given":"Michael","family":"Gatto","sequence":"first","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/509907.509930","volume-title":"STOC 2002","author":"S. Albers","year":"2002","unstructured":"Albers, S.: On randomized online scheduling. In: STOC 2002. Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 134\u2013143. ACM Press, New York (2002)"},{"issue":"3","key":"31_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 \u2013 methodology and applications. Mathematical Programming\u00a092(3), 453\u2013480 (2002)","journal-title":"Mathematical Programming"},{"key":"31_CR4","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V.: Linear Programming. Freeman, San Francisco (1983)"},{"issue":"6","key":"31_CR5","first-page":"343","volume":"3","author":"R. Fleischer","year":"2000","unstructured":"Fleischer, R., Wahl, M.: Online scheduling revisited. Journal of Scheduling, special issue on approximation algorithms for scheduling algorithms (part 2)\u00a03(6), 343\u2013353 (2000)","journal-title":"Journal of Scheduling, special issue on approximation algorithms for scheduling algorithms (part 2)"},{"issue":"9","key":"31_CR6","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessor anomalies. Bell System Techical Journal\u00a045(9), 1563\u20131581 (1966)","journal-title":"Bell System Techical Journal"},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics\u00a017(2), 416\u2013429 (1969)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/B:JOSH.0000013055.31639.f6","volume":"7","author":"N.G. Hall","year":"2004","unstructured":"Hall, N.G., Posner, M.E.: Sensitivity analysis for scheduling problems. Journal of Scheduling\u00a07, 49\u201383 (2004)","journal-title":"Journal of Scheduling"},{"issue":"5","key":"31_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ipl.2005.11.001","volume":"97","author":"A. Kasperski","year":"2006","unstructured":"Kasperski, A., Zieli\u0144ski, P.: An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett.\u00a097(5), 177\u2013180 (2006)","journal-title":"Inf. Process. Lett."},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0166-218X(94)90005-1","volume":"55","author":"A. Kolen","year":"1994","unstructured":"Kolen, A., Kan, A., van Hoesel, C., Wagelmans, A.: Sensitivity analysis of list scheduling heuristics. Discrete Applied Mathematics\u00a055, 145\u2013162 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"31_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P. Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publishers, Dordrecht (1997)"},{"issue":"6","key":"31_CR12","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(6), 924\u2013942 (1999)","journal-title":"Journal of the ACM"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1016\/S0305-0548(03)00114-X","volume":"31","author":"R. Montemanni","year":"2004","unstructured":"Montemanni, R., Gambardella, L.M.: An exact algorithm for the robust shortest path problem with interval data. Computers & Operations Research\u00a031, 1667\u20131680 (2004)","journal-title":"Computers & Operations Research"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ro:2003011","volume":"37","author":"A. Moukrim","year":"2003","unstructured":"Moukrim, A., Sanlaville, E., Guinan, F.: Parallel machine scheduling with uncertain communication delays. RAIRO Oper. Res.\u00a037, 1\u201316 (2003)","journal-title":"RAIRO Oper. Res."},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/S0377-2217(00)00281-2","volume":"134","author":"B. Penz","year":"2001","unstructured":"Penz, B., Rapine, C., Trystram, D.: Sensitivity analysis of scheduling algorithms. European Journal of Operational Research\u00a0134, 606\u2013615 (2001)","journal-title":"European Journal of Operational Research"},{"key":"31_CR16","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs (2002)"},{"issue":"5","key":"31_CR17","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10951-005-2864-6","volume":"8","author":"E. Sanlaville","year":"2005","unstructured":"Sanlaville, E.: Sensitivity bounds for machine scheduling with uncertain communication delays. Journal of Scheduling\u00a08(5), 461\u2013473 (2005)","journal-title":"Journal of Scheduling"},{"issue":"1","key":"31_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/1120582.1120585","volume":"53","author":"M. Scharbrodt","year":"2006","unstructured":"Scharbrodt, M., Schickinger, T., Steger, A.: A new average case analysis for completion time scheduling. Journal of the ACM\u00a053(1), 121\u2013146 (2006)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:05:56Z","timestamp":1619517956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739487","9783540739517"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}