Show simple item record

dc.contributor.authorBeliën, Jeroen
dc.contributor.authorDemeulemeester, Erik
dc.contributor.authorDe Bruecker, Philippe
dc.contributor.authorVan den Bergh, Jorne
dc.contributor.authorCardoen, Brecht
dc.date.accessioned2017-12-02T14:42:55Z
dc.date.available2017-12-02T14:42:55Z
dc.date.issued2013
dc.identifier.doi10.1016/j.cor.2012.11.011
dc.identifier.urihttp://hdl.handle.net/20.500.12127/4523
dc.description.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.
dc.language.isoen
dc.subjectStaffing
dc.subjectScheduling
dc.subjectAircraft Line Maintenance
dc.subjectMixed Integer Programming
dc.titleIntegrated staffing and scheduling for an aircraft line maintenance problem
dc.identifier.journalComputers & Operations Research
dc.source.volume40
dc.source.issue4
dc.source.beginpage1023
dc.source.endpage1033
vlerick.knowledgedomainOperations & Supply Chain Management
vlerick.knowledgedomainDigital Transformation
vlerick.typearticleJournal article with impact factor
vlerick.vlerickdepartmentTOM
dc.identifier.vperid140369
dc.identifier.vperid120992
dc.identifier.vperid156652
dc.identifier.vperid51529
dc.identifier.vperid156653
dc.identifier.vpubid5389


Files in this item

Thumbnail
Name:
Publisher version

This item appears in the following Collection(s)

Show simple item record