Integrated staffing and scheduling for an aircraft line maintenance problem
Publication typeArticle in academic journal
JournalComputers & Operations Research
Publication Begin page1023
Publication End page1033
MetadataShow full item record
AbstractThis 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.
Knowledge Domain/IndustryOperations & Supply Chain Management