{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:26:10Z","timestamp":1726413970823},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T00:00:00Z","timestamp":1248134400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10951-009-0115-y","type":"journal-article","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T16:00:14Z","timestamp":1248105614000},"page":"141-156","source":"Crossref","is-referenced-by-count":3,"title":["On robust online scheduling algorithms"],"prefix":"10.1007","volume":"14","author":[{"given":"Michael","family":"Gatto","sequence":"first","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,7,21]]},"reference":[{"key":"115_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. (1993). Network flows: theory, algorithms and applications. New York: Prentice Hall."},{"key":"115_CR2","isbn-type":"print","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/509907.509930","volume-title":"STOC \u201902: Proceedings of the 34th annual ACM symposium on theory of computing","author":"S. Albers","year":"2002","unstructured":"Albers, S. (2002). On randomized online scheduling. In STOC \u201902: Proceedings of the 34th annual ACM symposium on theory of computing (pp. 134\u2013143). New York, NY, USA, 2002. New York: ACM Press. ISBN 1-58113-495-9.","ISBN":"http:\/\/id.crossref.org\/isbn\/1581134959"},{"issue":"1","key":"115_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1287\/moor.1050.0170","volume":"31","author":"L. Becchetti","year":"2006","unstructured":"Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Schafer, G., & Vredeveld, T. (2006). Average-case and smoothed competitive analysis of the multilevel feedback algorithm. Mathematics of Operations Research, 31(1), 85\u2013108.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"115_CR4","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A. Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., & Nemirovski, A. (2002). Robust optimization\u2014methodology and applications. Mathematical Programming, 92(3), 453\u2013480.","journal-title":"Mathematical Programming"},{"key":"115_CR5","volume-title":"Linear programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V. (1983). Linear programming. New York: Freeman."},{"issue":"6","key":"115_CR6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R. Fleischer","year":"2000","unstructured":"Fleischer, R., & Wahl, M. (2000). Online scheduling revisited. Journal of Scheduling, 3(6), 343\u2013353. Special issue on approximation algorithms for scheduling algorithms (part 2).","journal-title":"Journal of Scheduling"},{"issue":"9","key":"115_CR7","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. (1966). Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45(9), 1563\u20131581.","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"115_CR8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(2), 416\u2013429.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"115_CR9","doi-asserted-by":"crossref","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. (2004). Sensitivity analysis for scheduling problems. Journal of Scheduling, 7, 49\u201383.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"115_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ipl.2005.11.001","volume":"97","author":"A. Kasperski","year":"2006","unstructured":"Kasperski, A., & Zieli\u0144ski, P. (2006). An approximation algorithm for interval data minmax regret combinatorial optimization problems. Information Processing Letters, 97(5), 177\u2013180. ISSN 0020-0190.","journal-title":"Information Processing Letters"},{"key":"115_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0166-218X(94)90005-1","volume":"55","author":"A. W. J. Kolen","year":"1994","unstructured":"Kolen, A. W. J., Rinnooy Kan, A. H. G., van Hoesel, C. S. M., & Wagelmans, A. P. M. (1994). Sensitivity analysis of list scheduling heuristics. Discrete Applied Mathematics, 55, 145\u2013162.","journal-title":"Discrete Applied Mathematics"},{"key":"115_CR12","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. (1997). Robust discrete optimization and its applications. Dordrecht: Kluwer Academic."},{"key":"115_CR13","doi-asserted-by":"crossref","unstructured":"Mauroy, G., Wardi, Y., & Proth, J. M. (1997). Sensitivity analysis of machine schedules with multi-priority job classes. In Proceedings of the 36th IEEE conference on decision and control (Vol.\u00a05067, pp.\u00a0686\u2013691).","DOI":"10.1109\/CDC.1997.650714"},{"issue":"3","key":"115_CR14","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.1060.0201","volume":"31","author":"N. Megow","year":"2006","unstructured":"Megow, N., Uetz, M., & Vredeveld, T. (2006). Models and algorithms for stochastic online scheduling. Mathematics of Operations Research, 31(3), 513\u2013525.","journal-title":"Mathematics of Operations Research"},{"issue":"6","key":"115_CR15","doi-asserted-by":"crossref","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. (1999). Approximation in stochastic scheduling: the power of LP-based priority policies. Journal of the ACM, 46(6), 924\u2013942.","journal-title":"Journal of the ACM"},{"key":"115_CR16","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1016\/S0305-0548(03)00114-X","volume":"31","author":"R. Montemanni","year":"2004","unstructured":"Montemanni, R., & Gambardella, L. M. (2004). An exact algorithm for the robust shortest path problem with interval data. Computers & Operations Research, 31, 1667\u20131680.","journal-title":"Computers & Operations Research"},{"key":"115_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:2003011","volume":"37","author":"A. Moukrim","year":"2003","unstructured":"Moukrim, A., Sanlaville, E., & Guinan, F. (2003). Parallel machine scheduling with uncertain communication delays. RAIRO Operations Research, 37, 1\u201316.","journal-title":"RAIRO Operations Research"},{"key":"115_CR18","doi-asserted-by":"crossref","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. (2001). Sensitivity analysis of scheduling algorithms. European Journal of Operational Research, 134, 606\u2013615.","journal-title":"European Journal of Operational Research"},{"key":"115_CR19","volume-title":"Scheduling: Theory, algorithms, and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M. (2002). Scheduling: Theory, algorithms, and systems. New York: Prentice Hall."},{"issue":"5","key":"115_CR20","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s10951-005-2864-6","volume":"8","author":"E. Sanlaville","year":"2005","unstructured":"Sanlaville, E. (2005). Sensitivity bounds for machine scheduling with uncertain communication delays. Journal of Scheduling, 8(5), 461\u2013473.","journal-title":"Journal of Scheduling"},{"key":"115_CR21","unstructured":"Sch\u00e4fer, G. (2004). Worst case instances are fragile. Average case and smoothed competitive analysis of algorithms. Ph.D. thesis, Universit\u00e4t des Saarlandes, April 2004."},{"issue":"1","key":"115_CR22","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/1120582.1120585","volume":"53","author":"M. Scharbrodt","year":"2006","unstructured":"Scharbrodt, M., Schickinger, T., & Steger, A. (2006). A new average case analysis for completion time scheduling. Journal of the ACM, 53(1), 121\u2013146.","journal-title":"Journal of the ACM"},{"key":"115_CR23","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/BFb0029570","volume-title":"Online algorithms: The state of the art","author":"J. Sgall","year":"1998","unstructured":"Sgall, J. (1998). On-line scheduling. In A. Fiat & G. J. Woeginger (Eds.), Lecture notes in computer science : Vol. 1442. Online algorithms: The state of the art (pp. 196\u2013231). Berlin: Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0115-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0115-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0115-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:42Z","timestamp":1559453982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0115-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,21]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["115"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0115-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2009,7,21]]}}}