The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints

摘要

Highlights?An operational tail assignment problem for the one-day routes business model.?A computational study of the one-day routes business model.?Formulation of look-ahead constraints to implicitly satisfy maintenance requirement.?Presents branch-and-price based algorithms for the tail assignment problem.?Described a novel adjustment process to improve maintenance planning.AbstractThe tail assignment problem is a critical part of the airline planning process that assigns specific aircraft to sequences of flights, called lines-of-flight, to satisfy operational constraints. The aim of this paper is to develop an operationally flexible method, based upon the one-day routes business model, to compute tail assignments that satisfy short-range—within t