Robust Possibilistic Programming Approach to Production Scheduling of Reconfigurable Manufacturing System Based on Learning Effect

The emergence of reconfigurable manufacturing offers innovative solutions for efficiently adapting to changing market demands and system modifications. This paper introduces a robust possibilistic programming framework to address a multi-objective production scheduling problem within sustainable reconfigurable manufacturing systems, incorporating uncertainty. The model captures the workforce learning effect on reconfiguration times, aiming to minimize makespan, production costs, and social sustainability while considering uncertain parameters. Possibilistic chance-constrained programming and robust possibilistic programming approaches are applied to assess both model and solution robustness. Additionally, the framework addresses workplace safety risks linked to workforce assignments and incorporates workforce entry preferences for flexible hours. By considering the learning effect in reconfiguration times, the model reflects the dynamic nature of scheduling, aligning more closely with real-world scenarios. The augmented epsilon-constraint method is also used to efficiently find Pareto-optimal solutions for the multi-objective model.

Authors

Institutions

Publication Details

Journal
IFAC-PapersOnLine
Published
2025-01-01
DOI
https://doi.org/10.1016/j.ifacol.2025.09.363
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust Possibilistic Programming Approach to Production Scheduling of Reconfigurable Manufacturing System Based on Learning Effect

Xavier Delorme, Lyès Benyoucef, Hichem Haddou Benderbal, Alireza Ostovari et al.
IFAC-PapersOnLine
Scheduling and Optimization Algorithms
article

Robust Possibilistic Programming Approach to Production Scheduling of Reconfigurable Manufacturing System Based on Learning Effect

Xavier Delorme, Lyès Benyoucef, Hichem Haddou Benderbal, Alireza Ostovari, Alexandre Dolgui
article en

Abstract

The emergence of reconfigurable manufacturing offers innovative solutions for efficiently adapting to changing market demands and system modifications. This paper introduces a robust possibilistic programming framework to address a multi-objective production scheduling problem within sustainable reconfigurable manufacturing systems, incorporating uncertainty. The model captures the workforce learning effect on reconfiguration times, aiming to minimize makespan, production costs, and social sustainability while considering uncertain parameters. Possibilistic chance-constrained programming and robust possibilistic programming approaches are applied to assess both model and solution robustness. Additionally, the framework addresses workplace safety risks linked to workforce assignments and incorporates workforce entry preferences for flexible hours. By considering the learning effect in reconfiguration times, the model reflects the dynamic nature of scheduling, aligning more closely with real-world scenarios. The augmented epsilon-constraint method is also used to efficiently find Pareto-optimal solutions for the multi-objective model.

IFAC-PapersOnLineVol. 59(10)
Centre National de la Recherche Scientifique (FR), Aix-Marseille Université (FR), Mines Saint-Étienne (FR), Laboratoire d’Informatique et Systèmes (FR), Laboratoire des Sciences du Numérique de Nantes (FR), IMT Atlantique (FR), Nantes Université (FR)
Openalex Percentile: Top 63%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.