优化飞机拆解调度，提升环保与利润。
Solving the Aircraft Disassembly Scheduling Problem
- 用约束规划和混合整数规划建模拆解流程。
- 解决超1450个任务的复杂调度，兼顾人员、设备与平衡要求。
- 适合航空回收与可持续制造领域从业者参考。
报废飞机的拆解是一项复杂的可持续性工程，但利润微薄，因此高效的拆解调度对保障盈利至关重要。该问题涉及数千个任务及多重约束：可再利用部件的拆卸需特定认证技术人员与专用设备，操作间存在先后顺序依赖，且整个过程需保持飞机平衡。此外，部分区域空间有限，限制同时作业人员数量。本文详细阐述该问题，并提出两种求解方法：约束规划模型与混合整数规划（MIP）模型。模型基于工业合作伙伴提供的真实运营数据，在包含最多1450个任务的不同规模实例上进行测试，验证了其有效性与实用性。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。