Journal of Computer and System Sciences
How not to lie with statistics: the correct way to summarize benchmark results
Communications of the ACM - The MIT Press scientific computation series
Studying overheads in massively parallel MIN/MAX-tree evaluation
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
The fleet assignment problem: solving a large-scale integer program
Mathematical Programming: Series A and B
Air transportation simulation: SimAir: a stochastic model of airline operations
Proceedings of the 32nd conference on Winter simulation
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
The reason for the benefits of minimax search
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Pathology on game trees revisited, and an alternative to minimaxing
Artificial Intelligence
The *-minimax search procedure for trees containing chance nodes
Artificial Intelligence
Computing delay resistant railway timetables
Computers and Operations Research
| Hi-index | 0.00 |
An important insufficiency of modern industrial plans is their lack of robustness. Disruptions prevent companies from operating as planned before and induce high costs for trouble shooting. The main reason for the severe impact of disruptions stems from the fact that planners do traditionally consider the precise input to be available at planning time. The Repair Game is a formalization of a planning task, and playing it performs disruption management and generates robust plans with the help of game tree search. Technically, at each node of a search tree, a traditional optimization problem is solved such that large parts of the computation time are blocked by sequential computations. Nevertheless, there is enough node parallelism which we can make use of, in order to bring the running times onto a real-time level, and in order to increase the solution quality per minute significantly. Thus, we are able to present a planning application at the cutting-edge of Operations Research, heavily taking advantage of parallel game tree search. We present simulation experiments which show the benefits of the repair game, as well as speedup results.