Solving the Aircraft Disassembly Scheduling Problem
Quick Take
The article addresses the Aircraft Disassembly Scheduling Problem, proposing a Constraint Programming model and a MIP model to optimize disassembly processes involving up to 1450 tasks. These models account for technician certifications, precedence relations, and spatial constraints, aiming to enhance profitability for air transport companies.
Key Points
- Two models proposed: Constraint Programming and MIP for disassembly scheduling.
- Models tested on real operational data with up to 1450 tasks.
- Focus on technician certifications and spatial constraints during disassembly.
- Efficient scheduling is crucial for profitability in aircraft dismantling.
- Precedence relations impact the order of extraction operations.
Article Excerpt
From source RSS / original summaryarXiv:2605. 23592v1 Announce Type: new Abstract: Dismantling aircrafts reaching their end of life is a complex endeavour that is necessary in terms of sustainability but yields small income margins for air transport companies. An efficient scheduling of the disassembly procedure is thus crucial to ensure the profitability of the process and incentivize practice.
This is a large scheduling problem that involves thousands of tasks and many different constraints: Extracting parts that are destined to be reused requires technicians with specific certifications and equipment. Extraction operations might be subject to precedence relations. Furthermore, the aircraft must be kept balanced during the whole process. Finally, some of the locations of the aircraft have a limited space that caps the number of technicians able to work there concurrently.
This article presents the problem in details and proposes two approaches to solve the problem: a Constraint Programming model and a MIP model. The models are tested on instances of varying sizes involving up to 1450 tasks, which are based on real operational data provided by an industrial partner.
Reader Mode unavailable (could not extract clean content).
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.AI
See more →The Importance of Out-of-Band Metadata for Safe Autonomous Agents: The Redpanda Agentic Data Plane
The Redpanda Agentic Data Plane (ADP) introduces out-of-band metadata channels to enhance the safety of autonomous AI agents, ensuring secure data access and tamper-proof audit trails. This architecture mitigates risks associated with unpredictable AI behavior by enforcing governance throughout the agent lifecycle, demonstrated in a multi-agent trading system with strict data scoping and approval thresholds.
