{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:29:24Z","timestamp":1725568164314},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287001"},{"type":"electronic","value":"9783540319252"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549468_138","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T17:18:34Z","timestamp":1288027114000},"page":"1265-1274","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallelism for Perturbation Management and Robust Plans"],"prefix":"10.1007","author":[{"given":"Jan","family":"Ehrhoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Grothklags","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulf","family":"Lorenz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"138_CR1","first-page":"55","volume":"11","author":"I. Alth\u00f6fer","year":"1988","unstructured":"Alth\u00f6fer, I.: Root evaluation errors: How they arise and propagate. ICCA Journal\u00a011(3), 55\u201363 (1988)","journal-title":"ICCA Journal"},{"issue":"3","key":"138_CR2","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0004-3702(83)80015-0","volume":"21","author":"B.W. Ballard","year":"1983","unstructured":"Ballard, B.W.: The *-minimax search procedure for trees containing chance nodes. Artificial Intelligence\u00a021(3), 327\u2013350 (1983)","journal-title":"Artificial Intelligence"},{"key":"138_CR3","unstructured":"Ehrhoff, J., Grothklags, S., Lorenz, U.: Das Reparaturspiel als Formalisierung von Planung unter Zufallseinfl\u00fcssen, angewendet in der Flugplanung. In: Proceedings of GOR conference: Entscheidungsunterst\u00fctzende Systeme in Supply Chain Managment und Logistik, pp. 335\u2013356. Physika-Verlag ,Heidelberg (2005)"},{"key":"138_CR4","doi-asserted-by":"crossref","unstructured":"Engell, S., M\u00e4rkert, A., Sand, G., Schultz, R.: Production planning in a multiproduct batch plant under uncertainty. Preprint 495-2001, FB Mathematik, Gerhard-Mercator-Universit\u00e4t Duisburg (2001)","DOI":"10.1007\/978-3-662-04331-8_32"},{"key":"138_CR5","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/181014.192325","volume-title":"6th ACM Annual symposium on parallel algorithms and architectures (SPAA 1994)","author":"R. Feldmann","year":"1994","unstructured":"Feldmann, R., Mysliwietz, M., Monien, B.: Studying overheads in massively parallel min\/max-tree evaluation. In: 6th ACM Annual symposium on parallel algorithms and architectures (SPAA 1994), pp. 94\u2013104. ACM, New York (1994)"},{"issue":"3","key":"138_CR6","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/5666.5673","volume":"29","author":"P.J. Flemming","year":"1986","unstructured":"Flemming, P.J., Wallace, J.J.: How not to lie with statistics: the correct way to summerize benchmark results. CACM\u00a029(3), 218\u2013221 (1986)","journal-title":"CACM"},{"key":"138_CR7","first-page":"211","volume":"70","author":"C.A. Hane","year":"1995","unstructured":"Hane, C.A., Barnhart, C., Johnson, E.L., Marsten, R.E., Nemhauser, G.L., Sigismondi, G.: The fleet assignment problem: solving a large-scale integer program. Mathematical Programming\u00a070, 211\u2013232 (1995)","journal-title":"Mathematical Programming"},{"key":"138_CR8","unstructured":"Kaindl, H., Scheucher, A.: The reason for the benefits of minmax search. In: Proc. of the 11 th IJCAI, Detroit, MI, pp. 322\u2013327 (1989)"},{"issue":"4","key":"138_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D.E. Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artificial Intelligence\u00a06(4), 293\u2013326 (1975)","journal-title":"Artificial Intelligence"},{"key":"138_CR10","unstructured":"Koenig, S., Furcy, D., Bauer, C.: Heuristic search-based replanning. In: Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling, pp. 294\u2013301 (2002)"},{"issue":"5","key":"138_CR11","first-page":"421","volume":"32","author":"P. Kouvelis","year":"2000","unstructured":"Kouvelis, P., Daniels, R.L., Vairaktarakis, G.: Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Transactions\u00a032(5), 421\u2013432 (2000)","journal-title":"IIE Transactions"},{"issue":"6","key":"138_CR12","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1080\/00207549408957010","volume":"32","author":"V.J. Leon","year":"1994","unstructured":"Leon, V.J., Wu, S.D., Storer, R.H.: A game-theoretic control approach for job shops in the presence of disruptions. International Journal of Production Research\u00a032(6), 1451\u20131476 (1994)","journal-title":"International Journal of Production Research"},{"issue":"1-2","key":"138_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0004-3702(83)80011-3","volume":"21","author":"D.S. Nau","year":"1983","unstructured":"Nau, D.S.: Pathology on game trees revisited, and an alternative to minimaxing. Artificial Intelligence\u00a021(1-2), 221\u2013244 (1983)","journal-title":"Artificial Intelligence"},{"key":"138_CR14","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","volume":"31","author":"C.H. Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: Games against nature. Journal of Computer and System Science\u00a031, 288\u2013301 (1985)","journal-title":"Journal of Computer and System Science"},{"issue":"4","key":"138_CR15","first-page":"4","volume":"6","author":"A. Reinefeld","year":"1983","unstructured":"Reinefeld, A.: An Improvement of the Scout Tree Search Algorithm. ICCA Journal\u00a06(4), 4\u201314 (1983)","journal-title":"ICCA Journal"},{"key":"138_CR16","doi-asserted-by":"crossref","unstructured":"R\u00f6misch, W., Schultz, R.: Multistage stochastic integer programming: an introduction. Online Optimization of Large Scale Systems, 581\u2013600 (2001)","DOI":"10.1007\/978-3-662-04331-8_29"},{"key":"138_CR17","unstructured":"Rosenberger, J.M., Schaefer, A.J., Goldsman, D., Johnson, E.L., Kleywegt, A.J., Nemhauser, G.L.: Simair: A stochastic model of airline operations. In: Winter Simulation Conference Proceedings (2000)"},{"key":"138_CR18","unstructured":"Russel, S., Norvig, P.: Artificial Intelligence, A Modern Approach. Prentice Hall Series in Artificial Intelligence (2003)"},{"key":"138_CR19","first-page":"256","volume":"41","author":"C.E. Shannon","year":"1950","unstructured":"Shannon, C.E.: Programming a computer for playing chess. PhilosophicalMagazine\u00a041, 256\u2013275 (1950)","journal-title":"PhilosophicalMagazine"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2005 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549468_138","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T16:35:51Z","timestamp":1636734951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549468_138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287001","9783540319252"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11549468_138","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}