期刊
COMPUTERS & OPERATIONS RESEARCH
卷 40, 期 4, 页码 1023-1033出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2012.11.011
关键词
Staffing; Scheduling; Aircraft line maintenance; Mixed integer programming
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. (C) 2012 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据