1196. A metaheuristic approach for the Three-Stage Remanufacturing System Scheduling Problem
Invited abstract in session TB-15: Heuristic Search 2, stream Combinatorial Optimization.
Tuesday, 10:30-12:00Room: Esther Simpson 1.08
Authors (first author is the speaker)
| 1. | Teodor A. Diaconescu
|
| Department of Computer Science and Statistics, King Juan Carlos University | |
| 2. | Alberto Herrán
|
| Computer Science, Universidad Rey Juna Carlos | |
| 3. | J. Manuel Colmenar
|
| Universidad Rey Juan Carlos |
Abstract
The Three-Stage Remanufacturing System Scheduling Problem (3T-RSSP) represents a challenge in circular economy implementations and directly supports the United Nations Sustainable Development Goals (SDGs). This NP-hard problem involves scheduling products through the three sequential stages of the system with the objective of minimizing makespan. The remanufacturing system in this problem is equipped with a configuration of unrelated parallel disassembly and reassembly workstations and parallel dedicated flow-shop-type reprocessing lines. In this work, we present an enhanced GRASP metaheuristic that significantly improves solution quality while reducing computational requirements. Our algorithm incorporates an optimized cost function calculation mechanism that substantially decreases execution times. We have determined the values of the parameters using irace. Experimental validation has been conducted on an expanded benchmark of 53 instances. Comparative analysis demonstrates that our approach consistently outperforms state-of-the-art methods, obtaining a higher percentage of best solutions with execution times reduced by up to two orders of magnitude.
Keywords
- Metaheuristics
- Combinatorial Optimization
- Scheduling
Status: accepted
Back to the list of papers