A bin packing approach to solve the aircraft maintenance task allocation problem

DOI10.1016/j.ejor.2021.01.027zbMath1487.90242OpenAlexW3125405874MaRDI QIDQ2031115

Qichen Deng, Max Witteman, Bruno Filipe Santos

Publication date: 8 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.01.027

zbMATH Keywords

schedulingbin packing problemaircraft maintenancetask allocationworst-fit decreasing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27)

Related Items (4)

Robust long-term aircraft heavy maintenance check scheduling optimization under uncertainty ⋮ Airline maintenance task rescheduling in a disruptive environment ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem

Cites Work

• An on-line algorithm for variable-sized bin packing
• Heuristics for the variable sized bin-packing problem
• Optimal combination of aircraft maintenance tasks by a novel simplex optimization method
• Fast algorithms for bin packing
• Algorithms for the variable sized bin packing problem
• A practical dynamic programming based methodology for aircraft maintenance check scheduling optimization
• Solving the variable size bin packing problem with discretized formulations
• Variable Sized Bin Packing

This page was built for publication: A bin packing approach to solve the aircraft maintenance task allocation problem