Integrated staffing and scheduling for an aircraft line maintenance problem
Name:
Publisher version
View Source
Access full-text PDFOpen Access
View Source
Check access options
Check access options
Publication type
Journal article with impact factorPublication Year
2013Journal
Computers & Operations ResearchPublication Volume
40Publication Issue
4Publication Begin page
1023Publication End page
1033
Metadata
Show full item recordAbstract
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.Knowledge Domain/Industry
Operations & Supply Chain ManagementDigital Transformation
ae974a485f413a2113503eed53cd6c53
10.1016/j.cor.2012.11.011