Integrated staffing and scheduling for an aircraft line maintenance problem
dc.contributor.author | Beliën, Jeroen | |
dc.contributor.author | Demeulemeester, Erik | |
dc.contributor.author | De Bruecker, Philippe | |
dc.contributor.author | Van den Bergh, Jorne | |
dc.contributor.author | Cardoen, Brecht | |
dc.date.accessioned | 2017-12-02T14:42:55Z | |
dc.date.available | 2017-12-02T14:42:55Z | |
dc.date.issued | 2013 | |
dc.identifier.doi | 10.1016/j.cor.2012.11.011 | |
dc.identifier.uri | http://hdl.handle.net/20.500.12127/4523 | |
dc.description.abstract | 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. | |
dc.language.iso | en | |
dc.subject | Staffing | |
dc.subject | Scheduling | |
dc.subject | Aircraft Line Maintenance | |
dc.subject | Mixed Integer Programming | |
dc.title | Integrated staffing and scheduling for an aircraft line maintenance problem | |
dc.identifier.journal | Computers & Operations Research | |
dc.source.volume | 40 | |
dc.source.issue | 4 | |
dc.source.beginpage | 1023 | |
dc.source.endpage | 1033 | |
vlerick.knowledgedomain | Operations & Supply Chain Management | |
vlerick.knowledgedomain | Digital Transformation | |
vlerick.typearticle | Journal article with impact factor | |
vlerick.vlerickdepartment | TOM | |
dc.identifier.vperid | 140369 | |
dc.identifier.vperid | 120992 | |
dc.identifier.vperid | 156652 | |
dc.identifier.vperid | 51529 | |
dc.identifier.vperid | 156653 | |
dc.identifier.vpubid | 5389 |