Solving the Aircraft Disassembly Scheduling Problem

• URL: http://arxiv.org/abs/2605.23592v1
• Date: Fri, 22 May 2026 13:01:16 GMT
• Title: Solving the Aircraft Disassembly Scheduling Problem
• Abstract summary: An efficient scheduling of the disassembly procedure is crucial to ensure the profitability of the process and practice.<n>This article presents the problem in details and proposes two approaches to solve the problem: a Constraint Programming model and a MIP model.
• Score: 2.2817442144155207
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Solving Parallel Machine Scheduling With Precedences and Cumulative Resource Constraints With Calendars [2.863183011550039]
  We introduce a novel variant of parallel machine scheduling with job precedences and calendar-based cumulative resource constraints.<n>We propose a construction as well as a tailored metaheuristic using local search to efficiently tackle large-scale problem instances.
  arXiv  Detail & Related papers  (2025-12-05T12:35:44Z)
• An Efficient Continuous-Time MILP for Integrated Aircraft Hangar Scheduling and Layout [0.0]
  We propose a continuous-time mixed-integer linear computation program that jointly optimize aircraft placement and timing.<n>A study benchmarks the model against a constructive order-of-magnitude speedup, probes large-scale performance, and quantifies its sensitivity to temporal congestion.
  arXiv  Detail & Related papers  (2025-08-04T17:25:36Z)
• Co-Saving: Resource Aware Multi-Agent Collaboration for Software Development [65.94639060883475]
  We propose a resource-aware multi-agent system -- Co-Saving.<n>Our key innovation is the introduction of "shortcuts"<n>Compared to the state-of-the-art MAS ChatDev, our method achieves an average reduction of 50.85% in token usage.
  arXiv  Detail & Related papers  (2025-05-28T02:23:53Z)
• Improving Failure Prediction in Aircraft Fastener Assembly Using Synthetic Data in Imbalanced Datasets [11.375891394482004]
  This paper emphasizes the importance of error detection and classification for efficient and safe assembly of threaded fasteners.<n>The paper proposes techniques like class weighting and data augmentation, specifically tailored for temporal series data, to improve classification performance.
  arXiv  Detail & Related papers  (2025-05-06T18:45:50Z)
• Haste Makes Waste: Evaluating Planning Abilities of LLMs for Efficient and Feasible Multitasking with Time Constraints Between Actions [56.88110850242265]
  We present Recipe2Plan, a novel benchmark framework based on real-world cooking scenarios.<n>Unlike conventional benchmarks, Recipe2Plan challenges agents to optimize cooking time through parallel task execution.
  arXiv  Detail & Related papers  (2025-03-04T03:27:02Z)
• PARTNR: A Benchmark for Planning and Reasoning in Embodied Multi-agent Tasks [57.89516354418451]
  We present a benchmark for Planning And Reasoning Tasks in humaN-Robot collaboration (PARTNR) We employ a semi-automated task generation pipeline using Large Language Models (LLMs) We analyze state-of-the-art LLMs on PARTNR tasks, across the axes of planning, perception and skill execution.
  arXiv  Detail & Related papers  (2024-10-31T17:53:12Z)
• A mathematical model for simultaneous personnel shift planning and unrelated parallel machine scheduling [3.0477617036157136]
  This paper addresses a production scheduling problem derived from an industrial use case. It focuses on unrelated parallel machine scheduling with the personnel availability constraint. It assumes shared personnel among machines, with one personnel required per machine for setup and supervision during job processing.
  arXiv  Detail & Related papers  (2024-02-24T01:04:04Z)
• Defining and executing temporal constraints for evaluating engineering artifact compliance [56.08728135126139]
  Process compliance focuses on ensuring that the actual engineering work is followed as closely as possible to the described engineering processes. Checking these process constraints is still a daunting task that requires a lot of manual work and delivers feedback to engineers only late in the process. We present an automated constraint checking approach that can incrementally check temporal constraints across inter-related engineering artifacts upon every artifact change.
  arXiv  Detail & Related papers  (2023-12-20T13:26:31Z)
• Concepts and Algorithms for Agent-based Decentralized and Integrated Scheduling of Production and Auxiliary Processes [78.120734120667]
  This paper describes an agent-based decentralized and integrated scheduling approach. Part of the requirements is to develop a linearly scaling communication architecture. The approach is explained using an example based on industrial requirements.
  arXiv  Detail & Related papers  (2022-05-06T18:44:29Z)
• Innovations in the field of on-board scheduling technologies [64.41511459132334]
  This paper proposes an onboard scheduler, that integrates inside an onboard software framework for mission autonomy. The scheduler is based on linear integer programming and relies on the use of a branch-and-cut solver. The technology has been tested on an Earth Observation scenario, comparing its performance against the state-of-the-art scheduling technology.
  arXiv  Detail & Related papers  (2022-05-04T12:00:49Z)
• Enabling Integration and Interaction for Decentralized Artificial Intelligence in Airline Disruption Management [0.0]
  Airline disruption management traditionally seeks to address three problem dimensions: aircraft scheduling, crew scheduling, and passenger scheduling, in that order. We provide a discussion and demonstration of an agnostic and systematic paradigm for enabling simultaneously-integrated recovery of all problem dimensions during airline disruption management.
  arXiv  Detail & Related papers  (2021-04-07T18:59:02Z)
• Task Scoping: Generating Task-Specific Abstractions for Planning [19.411900372400183]
  Planning to solve any specific task using an open-scope world model is computationally intractable. We propose task scoping: a method that exploits knowledge of the initial condition, goal condition, and transition-dynamics structure of a task. We prove that task scoping never deletes relevant factors or actions, characterize its computational complexity, and characterize the planning problems for which it is especially useful.
  arXiv  Detail & Related papers  (2020-10-17T21:19:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.