Beliën, JeroenDemeulemeester, ErikDe Bruecker, PhilippeVan den Bergh, JorneCardoen, Brecht2017-12-022017-12-02201310.1016/j.cor.2012.11.011http://hdl.handle.net/20.500.12127/4523This 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.enStaffingSchedulingAircraft Line MaintenanceMixed Integer ProgrammingComputers & Operations Research140369120992156652515291566535389