LAPSE:2025.0302
Published Article

LAPSE:2025.0302
Integration of MILP and Discrete-Event Simulation for Flowshop Scheduling Using Benders Decomposition
June 27, 2025
Abstract
Real-world flowshop problems which are very common in the chemical industry are often difficult to solve in a reasonable time with allocation, sequencing, and lot-sizing decisions. Although great progress has been made in the last 20 years regarding MILP model formulations and solution algorithms, realistically-sized flowshop problems with resource and buffer constraints are still difficult to solve. On the other hand, discrete-event simulation (DES) allows for very detailed modelling of process plants, but lacking of optimization capabilities. Simulation Optimization (SO) combines the high-detail DES with mathematical optimization. We show that is possible to integrate MILP and DES using Benders decomposition. We explain the Benders-DES (BDES) approach with a small motivation example with makespan minimization objective and apply it to a real-world case study of a formulation plant with seven formulation and filling lines with sequencing, allocation, and lot-sizing decisions. We show that the BDES approach performs comparably to the original monolithic-sequential MILP-DES approach. However, the key advantage of this method is the ability to leverage MILP optimization power without requiring a detailed model description.
Real-world flowshop problems which are very common in the chemical industry are often difficult to solve in a reasonable time with allocation, sequencing, and lot-sizing decisions. Although great progress has been made in the last 20 years regarding MILP model formulations and solution algorithms, realistically-sized flowshop problems with resource and buffer constraints are still difficult to solve. On the other hand, discrete-event simulation (DES) allows for very detailed modelling of process plants, but lacking of optimization capabilities. Simulation Optimization (SO) combines the high-detail DES with mathematical optimization. We show that is possible to integrate MILP and DES using Benders decomposition. We explain the Benders-DES (BDES) approach with a small motivation example with makespan minimization objective and apply it to a real-world case study of a formulation plant with seven formulation and filling lines with sequencing, allocation, and lot-sizing decisions. We show that the BDES approach performs comparably to the original monolithic-sequential MILP-DES approach. However, the key advantage of this method is the ability to leverage MILP optimization power without requiring a detailed model description.
Record ID
Keywords
Algorithms, Batch Process, Benders Decomposition, Optimization, Planning & Scheduling, Process Operations
Subject
Suggested Citation
Wallrath R, Zondervan E, Franke MB. Integration of MILP and Discrete-Event Simulation for Flowshop Scheduling Using Benders Decomposition. Systems and Control Transactions 4:936-941 (2025) https://doi.org/10.69997/sct.180841
Author Affiliations
Wallrath R: University of Twente, Faculty of Science and Technology, Enschede, The Netherlands; Bayer AG, Kaiser-Wilhelm Allee 1, Leverkusen, Germany
Zondervan E: Bayer AG, Kaiser-Wilhelm Allee 1, Leverkusen, Germany
Franke MB: University of Twente, Faculty of Science and Technology, Enschede, The Netherlands
Zondervan E: Bayer AG, Kaiser-Wilhelm Allee 1, Leverkusen, Germany
Franke MB: University of Twente, Faculty of Science and Technology, Enschede, The Netherlands
Journal Name
Systems and Control Transactions
Volume
4
First Page
936
Last Page
941
Year
2025
Publication Date
2025-07-01
Version Comments
Original Submission
Other Meta
PII: 0936-0941-1746-SCT-4-2025, Publication Type: Journal Article
Record Map
Published Article

LAPSE:2025.0302
This Record
External Link

https://doi.org/10.69997/sct.180841
Article DOI
Download
Meta
Record Statistics
Record Views
669
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.0302
Record Owner
PSE Press
Links to Related Works
References Cited
- Harjunkoski I, et al. Scope for industrial applications of production scheduling models and solution methods. Comput. Chem. Eng. 62:161 (2014) https://doi.org/10.1016/j.compchemeng.2013.12.001
- Klanke C, Engell S. Scheduling and batching with evolutionary algorithms in simulation-optimization of an industrial formulation plant. Comput. Ind. Eng. 174 (2022) https://doi.org/10.1016/j.cie.2022.108760
- de Sousa Junior WT, et al. Discrete simulation-based optimization methods for industrial engineering problems: A systematic literature review. Comput. Ind. Eng. 128:526-540 (2019) https://doi.org/10.1016/j.cie.2018.12.073
- Teerasoponpong S, Sopadang S. A simulation-optimization approach for adaptive manufacturing capacity planning in small and medium-sized enterprises. Expert Syst. Appl. 168 (2021) https://doi.org/10.1016/j.eswa.2020.114451
- Tliba K, et al. Digital twin-driven dynamic scheduling of a hybrid flow shop. J. Intell. Manuf. 34:2281-2306 (2023) https://doi.org/10.1007/s10845-022-01922-3
- Wallrath R, et al. A time-bucket MILP formulation for optimal lot-sizing and scheduling of real-world chemical batch plants. Comput. Chem. Eng. 177 (2023) https://doi.org/10.1016/j.compchemeng.2023.108341
- Wallrath R, Franke MB. Integration of MILP and discrete-event simulation for flow shop scheduling using Benders cuts. Comput. Chem. Eng. 189 (2024) https://doi.org/10.1016/j.compchemeng.2024.108809
- Rahmaniani R, et al. The Benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259:801-817 (2017) https://doi.org/10.1016/j.ejor.2016.12.005
- Demir Y, Kürsat Isleyen, S. Evaluation of mathematical models for flexible job-shop scheduling problems. Appl. Math. Model. 37:977-988 (2013) https://doi.org/10.1016/j.apm.2012.03.020

