arXiv cs.AIMonday · May 25, 2026FREE

Solving the Aircraft Disassembly Scheduling Problem

The arXiv paper "Solving the Aircraft Disassembly Scheduling Problem," published on May 25, 2026, details the complex process of dismantling end-of-life aircraft. This endeavor is crucial for sustainability but often generates small income margins for air transport companies, making efficient scheduling vital for profitability and wider adoption. The problem is characterized by thousands of interdependent tasks and numerous constraints. Key challenges include matching technicians with specific certifications and equipment to extraction operations, respecting precedence relations between tasks, continuously maintaining the aircraft's balance during disassembly, and managing limited physical space that restricts the number of technicians working concurrently in certain areas. To address this large-scale optimization problem, the researchers propose two distinct modeling approaches: a Constraint Programming (CP) model and a Mixed-Integer Programming (MIP) model. These models are designed to systematically manage the intricate web of tasks, resources, and spatial-temporal constraints inherent in aircraft disassembly. The efficacy of both models was rigorously tested on various instance sizes, including scenarios with up to 1450 tasks. The data used for these tests was based on real operational information supplied by an industrial partner, ensuring the practical applicability and relevance of the solutions. This work provides concrete methods for optimizing complex industrial logistics, potentially enhancing the economic viability and environmental benefits of aircraft recycling.