Disruption Management and Planning with Uncertainties in Aircraft Planning

Dagstuhl Seminar Proceedings

Volumn 5031, Issue , 2005, Pages

  Ehrhoff, J ^a   Grothklags, S ^a   Lorenz, U ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84941339653     PISSN: 18624405     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. A. de Bruin A. Plaat, J. Schaeffer and W. Pijls. A minimax Algorithm better than SSS∗. Artificial Intelligence, 87:255-293, 1999.
2. I. Althofer. Root evaluation errors: How they arise and propagate. ICC A Journal, 11(3):55-63, 1988.
3. B.W. Ballard. The ∗-minimax search procedure for trees containing chance nodes. Artificial Intelligence, 21(3):327-350, 1983.
4. S. Engell, A. Markert, G. Sand, and R. Schultz. Production planning in a multiproduct batch plant under uncertainty. Preprint 495-2001, FB Mathematik, Gerhard-Mercator-Universitat Duisburg, 2001.
5. Z. Gu, E.L. Johnson, G.L. Nemhauser, and Y. Wang. Some properties of the fleet assignment problem. Operations Research Letters, 15:59-71, 1994.
6. C.A. Hane, C. Barnhart, E.L. Johnson, R.E. Marsten, G.L. Nemhauser, and G. Sigismondi. The fleet assignment problem: solving a large-scale integer program. Mathematical Programming, 70:211-232, 1995.
7. H. Kaindl and A. Scheucher. The reason for the benefits of minmax search. In Proc. of the 11 th IJCAI, pages 322-327, Detroit, MI, 1989.
8. D.E. Knuth and R.W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, 6(4):293-326, 1975.
9. S. Koenig, D. Furcy, and Colin Bauer. Heuristic search-based replanning. In Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling, pages 294-301, 2002.
10. P. Kouvelis, R.L. Daniels, and G. Vairaktarakis. Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Transactions, 32(5):421-432, 2000.
11. V.J. Leon, S.D. Wu, and R.h. Storer. A game-theoretic control approach for job shops in the presence of disruptions. International Journal of Production Research, 32(6):1451-1476, 1994.
12. D.S. Nau. Pathology on game trees revisited, and an alternative to minimaxing. Ariificial Intelligence, 21(l-2):221-244, 1983.
13. A. Reinefeld. An Improvement of the Scout Tree Search Algorithm. ICCA Journal, 6(4):4-14, 1983.
14. W. Romisch and R. Schultz. Multistage stochastic integer programming: an introduction. Online Optimization of Large Scale Systems, pages 581-600, 2001.
15. J. M. Rosenberger. Topics in Airline Operations. 2000. PhD-Thesis, Georgia Institute of Technology, Atlanta, GA 30332.
16. S. Russel and P. Norvig. Ariificial Intelligence, A Modern Approach. 2003. Prentice Hall Series in Artificial Intelligence.
17. A. Scholl. Robuste Planung und Optimierung. Physiker Verlag, 2001.
18. C.E. Shannon. Programming a computer for playing chess. Philosophical Magazine, 41:256-275, 1950.