Multi-objective General Variable Neighborhood Search for the Online Flexible Job Shop Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Multi-objective General Variable Neighborhood Search for the Online Flexible Job Shop Problem

Résumé

This paper introduces an approach based on the general variable neighborhood search algorithm to address the multi-objective online flexible job shop scheduling problem where new jobs arrive in batches at various times. We focus on minimizing two objectives, the maximum tardiness and the maximum workload. Additional objectives can be easily integrated if necessary. A penalty-based system is proposed to enhance schedule stability and minimize operator fatigue during the rescheduling process whenever a new batch of operations arrives in a workshop. Preliminary results showcase the effectiveness of this approach compared to the offline variant.
Fichier non déposé

Dates et versions

hal-04615186 , version 1 (18-06-2024)

Identifiants

Citer

Quentin Perrachon, Essognim Richard Wilouwou, Alexandru-Liviu Olteanu, Marc Sevaux, Arwa Khannoussi. Multi-objective General Variable Neighborhood Search for the Online Flexible Job Shop Problem. Proceedings of the 15th Metaheuristics International Conference (MIC 2024), Jun 2024, Lorient, France. pp.387-393, ⟨10.1007/978-3-031-62922-8_32⟩. ⟨hal-04615186⟩
6 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More