TY - GEN
T1 - A branch-and-cut algorithm framework for the integrated aircraft hangar maintenance scheduling and staffing problem
AU - Qin, Yichen
AU - Chan, Felix T.S.
AU - Chung, S. H.
AU - Qu, T.
PY - 2019/3/1
Y1 - 2019/3/1
N2 - The problem of maintenance scheduling and staffing at an aircraft heavy maintenance service company is studied. The objective is to establish an integrated aircraft maintenance schedule and maintenance technicians’ rosters to fulfil different maintenance requests while minimizing the overall tardiness cost and labor cost. Upon receiving the maintenance requests, the hangar planner has to determine if the maintenance company is capable to serve the aircraft within the planning period, then allocate the parking stands and staying time of each aircraft in the hangar for the subsequent maintenance operations. Due to the complexity of the combinatorial problem, the commercial solver using branch-and-bound algorithm is incapable to tackle with the medium-sized instance within reasonable time. To enhance the computational efficiency, a framework of branch-and-cut algorithm is proposed in this paper, aiming to decompose the original model and tighten the lower bound of the original problem by the effective cuts. The concept of combinatorial benders’ decomposition algorithm is adopted in the development of algorithm.
AB - The problem of maintenance scheduling and staffing at an aircraft heavy maintenance service company is studied. The objective is to establish an integrated aircraft maintenance schedule and maintenance technicians’ rosters to fulfil different maintenance requests while minimizing the overall tardiness cost and labor cost. Upon receiving the maintenance requests, the hangar planner has to determine if the maintenance company is capable to serve the aircraft within the planning period, then allocate the parking stands and staying time of each aircraft in the hangar for the subsequent maintenance operations. Due to the complexity of the combinatorial problem, the commercial solver using branch-and-bound algorithm is incapable to tackle with the medium-sized instance within reasonable time. To enhance the computational efficiency, a framework of branch-and-cut algorithm is proposed in this paper, aiming to decompose the original model and tighten the lower bound of the original problem by the effective cuts. The concept of combinatorial benders’ decomposition algorithm is adopted in the development of algorithm.
KW - Aircraft hangar maintenance
KW - Branch-and-cut algorithm
KW - Hangar layout planning
KW - Workforce scheduling
UR - http://www.scopus.com/inward/record.url?scp=85066952451&partnerID=8YFLogxK
U2 - 10.1145/3322645.3322662
DO - 10.1145/3322645.3322662
M3 - Conference article published in proceeding or book
AN - SCOPUS:85066952451
SN - 9781450361033
T3 - ACM International Conference Proceeding Series
SP - 200
EP - 203
BT - ACM International Conference Proceeding Series
PB - Association for Computing Machinery
T2 - 2nd International Conference on Information Science and System, ICISS 2019
Y2 - 16 March 2019 through 19 March 2019
ER -