Abstract
In any airline’s schedule development process, aircraft rotations must be planned for individual fleet types after fleet assignment. The aircraft rotation plans must conform to stringent maintenance requirements and this problem can be formulated as a periodic routing problem on an Eulerian graph. We analyze the computational complexity of developing maintenance rotations when some overnighting aircraft may not have sufficient time on the ground to complete extended maintenance (referred to as a maintenance infeasibility). The paper also provides a theoretical analysis of heuristics for the aircraft maintenance rotation problem with maintenance infeasibilities.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
