LAPSE:2025.0271
Published Article

LAPSE:2025.0271
Enhancing Large-Scale Production Scheduling Using Machine-Learning Techniques
June 27, 2025
Abstract
This study focuses on optimizing production scheduling in multi-product plants with shared resources and costly changeover operations. Specifically, two main challenges are addressed, the unknown changeover behavior of new products and the need for rapid schedule generation after unforeseen events. An innovative framework integrating Machine Learning (ML) techniques with Mixed-Integer Linear Programming (MILP) is proposed for single-stage production processes. Initially, a regression model predicts unknown changeover times based on key product attributes. Then, a representation where distances correlate with changeover times is compiled through multidimensional scaling, allowing constrained clustering to group production orders according to available packing lines. Ultimately, the MILP model generates the production schedule within a constrained solution space, utilizing optimal product-to-line allocation from cluster segmentation. A case study inspired by a Greek construction materials plant is used to validate the proposed approach. The results showed that this framework improves scheduling efficiency by providing rapid solutions, reducing downtime and facilitating the introduction of new products. Overall, a novel scheduling solution is proposed for manufacturing industries that face unknown production data and need quick schedule alternations.
This study focuses on optimizing production scheduling in multi-product plants with shared resources and costly changeover operations. Specifically, two main challenges are addressed, the unknown changeover behavior of new products and the need for rapid schedule generation after unforeseen events. An innovative framework integrating Machine Learning (ML) techniques with Mixed-Integer Linear Programming (MILP) is proposed for single-stage production processes. Initially, a regression model predicts unknown changeover times based on key product attributes. Then, a representation where distances correlate with changeover times is compiled through multidimensional scaling, allowing constrained clustering to group production orders according to available packing lines. Ultimately, the MILP model generates the production schedule within a constrained solution space, utilizing optimal product-to-line allocation from cluster segmentation. A case study inspired by a Greek construction materials plant is used to validate the proposed approach. The results showed that this framework improves scheduling efficiency by providing rapid solutions, reducing downtime and facilitating the introduction of new products. Overall, a novel scheduling solution is proposed for manufacturing industries that face unknown production data and need quick schedule alternations.
Record ID
Keywords
Subject
Suggested Citation
Samouilidou ME, Passalis N, Georgiadis GP, Georgiadis MC. Enhancing Large-Scale Production Scheduling Using Machine-Learning Techniques. Systems and Control Transactions 4:741-746 (2025) https://doi.org/10.69997/sct.168290
Author Affiliations
Samouilidou ME: Aristotle University of Thessaloniki, Department of Chemical Engineering, University Campus, Thessaloniki, 54124, Greece
Passalis N: Aristotle University of Thessaloniki, Department of Chemical Engineering, University Campus, Thessaloniki, 54124, Greece
Georgiadis GP: Aristotle University of Thessaloniki, Department of Chemical Engineering, University Campus, Thessaloniki, 54124, Greece
Georgiadis MC: Aristotle University of Thessaloniki, Department of Chemical Engineering, University Campus, Thessaloniki, 54124, Greece
Passalis N: Aristotle University of Thessaloniki, Department of Chemical Engineering, University Campus, Thessaloniki, 54124, Greece
Georgiadis GP: Aristotle University of Thessaloniki, Department of Chemical Engineering, University Campus, Thessaloniki, 54124, Greece
Georgiadis MC: Aristotle University of Thessaloniki, Department of Chemical Engineering, University Campus, Thessaloniki, 54124, Greece
Journal Name
Systems and Control Transactions
Volume
4
First Page
741
Last Page
746
Year
2025
Publication Date
2025-07-01
Version Comments
Original Submission
Other Meta
PII: 0741-0746-1202-SCT-4-2025, Publication Type: Journal Article
Record Map
Published Article

LAPSE:2025.0271
This Record
External Link

https://doi.org/10.69997/sct.168290
Article DOI
Download
Meta
Record Statistics
Record Views
839
Version History
[v1] (Original Submission)
Jun 27, 2025
Verified by curator on
Jun 27, 2025
This Version Number
v1
Citations
Most Recent
This Version
URL Here
https://psecommunity.org/LAPSE:2025.0271
Record Owner
PSE Press
Links to Related Works
References Cited
- Jiang Z, Yuan S, Ma J, Wang Q. The evolution of production scheduling from Industry 3.0 through Industry 4.0. Int J Prod Res 60(11):3534-3554 (2022) https://doi.org/10.1126/science.aaa8415
- Das K, Baki MF, Li X. Optimization of operation and changeover time for production planning and scheduling in a flexible manufacturing system. Comput Ind Eng 56(1):283-293 (2009) https://doi.org/10.1016/j.cie.2008.06.001
- Georgiadis GP, PampĂn BM, Cabo DA, Georgiadis MC. Optimal production scheduling of food process industries. Comput Chem Eng 134:106682 (2020) https://doi.org/10.1016/j.compchemeng.2019.106682
- Nazarian E, Ko J, Wang H. Design of multi-product manufacturing lines with the consideration of product change-dependent inter-task times, reduced changeover and machine flexibility. J Manuf Syst 29(1):35-46 (2010) https://doi.org/10.1016/j.jmsy.2010.08.001
- Velez S, Dong Y, Maravelias CT. Changeover formulations for discrete-time mixed-integer programming scheduling models. Eur J Oper Res 260(3):949-963 (2017) https://doi.org/10.1016/j.ejor.2017.01.004
- Castro PM, Harjunkoski I, Grossmann IE. Greedy algorithm for scheduling batch plants with sequence-dependent changeovers. AIChE J 57(2):373-387 (2011) https://doi.org/10.1002/aic.12261
- Samadi A, Maravelias CT. Computational enhancements of continuous production scheduling MILPs using tightening constraints. Comput Chem Eng 184:108609 (2024) https://doi.org/10.1016/j.compchemeng.2024.108609
- Heger J, Branke J, Hildebrandt T, Scholz-Reiter B. Dynamic adjustment of dispatching rule parameters in flow shops with sequence-dependent set-up times. Int J Prod Res 54(22):6812-6824 (2016) https://doi.org/10.1080/00207543.2016.1178406
- Gomes M, Silva F, Ferraz F, Silva A, Analide C, Novais P. Developing an ambient intelligent-based decision support system for production and control planning. Intelligent systems design and applications: 984-994 (2017) https://doi.org/10.1007/978-3-319-53480-0_97
- Hubbs CD, Li C, Sahinidis NV, Grossmann IE, Wassick JM. A deep reinforcement learning approach for chemical production scheduling. Comput Chem Eng 141:106982 (2020) https://doi.org/10.1016/j.compchemeng.2020.106982
- Passalis N, Tefas A. Information clustering using manifold-based optimization of the bag-of-features representation. IEEE Trans Cybern 48(1):52-63 (2016) https://doi.org/10.1109/TCYB.2016.2623581
- Elekidis AP, Corominas F, Georgiadis MC. Production scheduling of consumer goods industries. Ind Eng Chem Res 58:23261-23275 (2019) https://doi.org/10.1021/acs.iecr.9b04907
(0.26 seconds)

