Resolving infeasibilities in the PESP model of the Dutch railway timetabling problem

Many times the railway timetabling problem is infeasible. This means a set of constraints can not be satisfied at the same time. It is hard to solve this by hand. This thesis proposed two algorithm to resolve the infeasibilities and to come up with a timetable. It serves as an extention to the CADANS solver.