Exploring the Partial Enumeration Problem for Dynamic Hybrid Flowshop Scheduling with Machine Learning
Optimizing resource allocation in dynamic production environments, particularly in Hybrid Flow-Shops (HFS), remains a challenging task. Building on prior work that combined Genetic Algorithms (GA) and Machine Learning (ML) to predict near-optimal allocations (Hamiti et al. (2024)), this study identifies and addresses an issue termed the "partial enumeration problem". This problem arises from impossibility to represent different solutions with equal qualities during data generation, leading to reduced ML models performances. By formalizing the concept, categorizing it, and developing algorithms to detect and mitigate these inconsistencies, by refining training data to account for this issue, this work lays the foundation for future ML models capable of improving decision-making in dynamic and flexible manufacturing systems.
Authors
- Wassim Bouazza (ORCID: https://orcid.org/0000-0001-6290-5591)
- Arnaud Laurent (ORCID: https://orcid.org/0000-0002-0516-8609)
- Nasser Mebarki (ORCID: https://orcid.org/0000-0002-2172-6252)
- Abdelhakim Ghiles Hamiti
Institutions
- École Centrale de Nantes (FR)
- Centre National de la Recherche Scientifique (FR)
- Laboratoire des Sciences du Numérique de Nantes (FR)
- Nantes Université (FR)
Publication Details
- Journal
- IFAC-PapersOnLine
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1016/j.ifacol.2025.09.155
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00