Integrated staffing and scheduling for an aircraft line maintenance problem

This paper studies the problem of constructing the workforce schedules of an aircraft maintenance company. The problem involves both a staffing and a scheduling decision. We propose an enumerative algorithm with bounding in which each node of the enumeration tree represents a mixed integer linear problem (MILP). We reformulate the MILP such that it becomes tractable for commercial MILP solvers. Extensive computational tests on 40 instances that are derived from a real-life setting indicate that the algorithm is capable of finding close-to-optimal solutions. © 2012 Elsevier Ltd.publisher: Elsevier articletitle: Integrated staffing and scheduling for an aircraft line maintenance problem journaltitle: Computers & Operations Research articlelink: http://dx.doi.org/10.1016/j.cor.2012.11.011 content_type: article copyright: Copyright © 2012 Elsevier Ltd. All rights reserved.status: publishe