Plan repair in decoupled Simple Temporal Problems

Airports will face congestion problems due to increasing air traffic. Since airport expansion is not always possible, other solutions must be found. One solution could be to make better use of the parties at an airport. Ground handling parties are an example of parties at an airport. Aircraft fueling, passenger boarding and cleaning of an aircraft are examples of ground handling processes, which are performed by ground handling parties. This thesis focuses on replanning of ground handling processes. The original ground handling process plan is modeled as a Simple Temporal Problem. By solving the Temporal Decoupling Problem for a given plan, the plan is split into several independent subplans, each subplan represents a plan for a service provider. Whenever an aircraft is delayed or one of the ground handling processes is disturbed, the current plan may become infeasible. Subsequently, repair algorithms have to be applied to repair the broken plan. The main contribution of this thesis is to propose repair algorithms for a ground handling process plan, modeled as a decoupled Simple Temporal Problem.Software TechnologyElectrical Engineering, Mathematics and Computer Scienc