Performance investigation of metaheuristics for the just-in-time single-machine under different time windows and setup restrictions

Author(s)

de Freitas, Miguel Goncalves ; Abreu, Alex Paranahyba ; Branco, Fabio Jose Ceron ; Fuchigami, Helio Yochihiro ; de Mello, Rian Tavares

• Document type: Journal article
• Source: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS; v. N/A, p. 10-pg., 2025-03-14.

Abstract

In this paper, we assess the performance of five metaheuristics for the single-machine under different time windows and sequence-dependent setup times, optimizing the total weighted earliness and tardiness: Iterated Greedy Algorithm (IGA), Artificial Bee Colony (ABC), Bat Algorithm (BA), Particle Swarm Optimization (PSO), and Fireworks Algorithm (FWA). Many real-world situations require delivery in a specific time interval, analogous to optimization problems with a time window in the Just-in-Time philosophy. Also, several practical situations require different time intervals to prepare the environment to process the activities depending on what was immediately done and what will be executed next, characterizing the sequence-dependent setup problem. These cases are common among operations handling materials of diverse colors, different temperatures, or high demands on sterilization requirements. Statistical results highlight the superiority of the FWA, with the best results in all the problem dimensions analyzed, especially in the larger-size instances, with only 1.23% average relative deviation against 61.18% of the known Iterated Greedy algorithm. (c) 2025 by the authors; licensee Growing Science, Canada (AU)

• FAPESP's process: 23/08678-8 - Green pickup and delivery problems under demand and travel time uncertainty
• Grantee: Alex Paranahyba de Abreu
• Support Opportunities: Scholarships abroad - Research Internship - Master's degree
• FAPESP's process: 22/05803-3 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings
• Grantee: Reinaldo Morabito Neto
• Support Opportunities: Research Projects - Thematic Grants
• FAPESP's process: 22/10993-6 - Vehicle routing problems with pickup and delivery under travel time and demand uncertainty
• Grantee: Alex Paranahyba de Abreu
• Support Opportunities: Scholarships in Brazil - Master