LAPSE:2025.0279v1
Published Article
LAPSE:2025.0279v1
A Novel Global Sequence-based Mathematical Formulation for Energy-efficient Flexible Job Shop Scheduling Problem
June 27, 2025
Abstract
With increasing emphasis on energy efficiency, more researchers are focusing on energy-efficient flexible job shop scheduling problems. Mathematical programming is a commonly used optimization method for such scheduling challenges, offering the advantages of achieving global optima and serving as a foundation for other approaches. However, current mathematical programming formulations face several challenges, including insufficient consideration of various forms of energy consumption and low efficiency, particularly in handling large-scale instances, which struggle to converge. In this study, we propose a novel global sequence-based approach with high computational efficiency. In this model, immediate precedence relationships are identified using constraints, enabling the precise determination of idle durations within any idle slots. The proposed formulation achieves a significant reduction in energy consumption by up to 20% relative to other formulations. Furthermore, it successfully reaches feasible solutions in challenging cases.
With increasing emphasis on energy efficiency, more researchers are focusing on energy-efficient flexible job shop scheduling problems. Mathematical programming is a commonly used optimization method for such scheduling challenges, offering the advantages of achieving global optima and serving as a foundation for other approaches. However, current mathematical programming formulations face several challenges, including insufficient consideration of various forms of energy consumption and low efficiency, particularly in handling large-scale instances, which struggle to converge. In this study, we propose a novel global sequence-based approach with high computational efficiency. In this model, immediate precedence relationships are identified using constraints, enabling the precise determination of idle durations within any idle slots. The proposed formulation achieves a significant reduction in energy consumption by up to 20% relative to other formulations. Furthermore, it successfully reaches feasible solutions in challenging cases.
Record ID
Keywords
Subject
Suggested Citation
Li D, Zheng T, Li J. A Novel Global Sequence-based Mathematical Formulation for Energy-efficient Flexible Job Shop Scheduling Problem. Systems and Control Transactions 4:791-797 (2025) https://doi.org/10.69997/sct.133585
Author Affiliations
Li D: The University of Manchester, Department of Chemical Engineering, Manchester, UK
Zheng T: The University of Manchester, Department of Chemical Engineering, Manchester, UK
Li J: The University of Manchester, Department of Chemical Engineering, Manchester, UK
Zheng T: The University of Manchester, Department of Chemical Engineering, Manchester, UK
Li J: The University of Manchester, Department of Chemical Engineering, Manchester, UK
Journal Name
Systems and Control Transactions
Volume
4
First Page
791
Last Page
797
Year
2025
Publication Date
2025-07-01
Version Comments
Original Submission
Other Meta
PII: 0791-0797-1322-SCT-4-2025, Publication Type: Journal Article
Record Map
Published Article
LAPSE:2025.0279v1
This Record
External Link
https://doi.org/10.69997/sct.133585
Article DOI
Download
Meta
Record Statistics
Record Views
887
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
http://psecommunity.org/LAPSE:2025.0279v1
Record Owner
PSE Press
Links to Related Works
References Cited
- Yang L, Li J, Chao F, Hackney P, Flanagan M. Job shop planning and scheduling for manufacturers with manual operations. Expert Syst 38: e12315 (2021) https://doi.org/10.1111/exsy.12315
- Liao J, Lin C. Optimization and simulation of job-shop supply chain scheduling in manufacturing enterprises based on particle swarm optimization. Int J Simul Model 18:187-196 (2019) https://doi.org/10.2507/IJSIMM18(1)CO5
- Nouri HE, Driss OB, Ghédira K. A classification schema for the job shop scheduling problem with transportation resources: state-of-the-art review. Artif Intell Perspect Intell Syst Adv Intell Syst Comput 464:1-11 (2016) https://doi.org/10.1007/978-3-319-33625-1_1
- Tian Z, Jiang X, Liu W, Li Z. Dynamic energy-efficient scheduling of multi-variety and small batch flexible job-shop: a case study for the aerospace industry. Comput Ind Eng 178:109111 (2023) https://doi.org/10.1016/j.cie.2023.109111
- Jiang X, Tian Z, Liu W, Suo Y, Chen K, Xu X, Li Z. Energy-efficient scheduling of flexible job shops with complex processes: a case study for the aerospace industry complex components in China. J Ind Inf Integr 27:100293 (2022) https://doi.org/10.1016/j.jii.2021.100293
- Brucker P, Schlie R. Job-shop scheduling with multipurpose machines. Computing 45:369-375 (1990) https://doi.org/10.1007/BF02238804
- Demir Y, Isleyen SK. 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
- Ham A, Park MJ, Kim KM. Energy-aware flexible job shop scheduling using mixed integer programming and constraint programming. Math Probl Eng 2021:1-12 https://doi.org/10.1155/2021/8035806
- Wang S, Yu J. An effective heuristic for flexible job-shop scheduling problem with maintenance activities. Comput Ind Eng 59:436-447 (2010) https://doi.org/10.1016/j.cie.2010.05.016
- Li X, Gao L. An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93-110 (2016) https://doi.org/10.1016/j.ijpe.2016.01.016
- Ding H, Gu X. Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem. Comput Oper Res 121:104951 (2020) https://doi.org/10.1016/j.cor.2020.104951
- Xie J, Gao L, Peng K, Li X, Li H. Review on flexible job shop scheduling. IET Collab Intell Manuf 1:67-77 (2019) https://doi.org/10.1049/iet-cim.2018.0009
- Coelho P, Pinto A, Moniz S, Silva C. Thirty years of flexible job-shop scheduling: a bibliometric study. Procedia Comput Sci 180:787-796 (2021) https://doi.org/10.1016/j.procs.2021.01.329
- U.S. Energy Information Administration. https://www.eia.gov/energyexplained/use-of-energy/industry.php (2023) [13 July 2023]
- Nguyen TAL, Tran LNH, Paris H, Mathieu M. Evaluating energy efficiency of production machine. Appl Mech Mater 889:580-587 (2019) http://doi.org/10.4028/www.scientific.net/AMM.889.580 https://doi.org/10.4028/www.scientific.net/AMM.889.580
- Meng L, Ren Y, Zhang B, Li JQ, Sang H, Zhang C. MILP modeling and optimization of energy-efficient distributed flexible job shop scheduling problem. IEEE Access 8:3032548 (2020) https://doi.org/10.1109/ACCESS.2020.3032548
- Meng L, Zhang C, Shao X, Ren Y. MILP models for energy-aware flexible job shop scheduling problem. J Clean Prod 210:118289 (2019) https://doi.org/10.1016/j.jclepro.2018.11.021
- Zhang L, Li Z, Królczyk G, Wu D, Tang Q. Mathematical modeling and multi-attribute rule mining for energy efficient job-shop scheduling. J Clean Prod 241:118289 (2019) https://doi.org/10.1016/j.jclepro.2019.118289
- Park MJ, Ham A. Energy-aware flexible job shop scheduling under time-of-use pricing. Int J Prod Econ 248:108507 (2022) https://doi.org/10.1016/j.ijpe.2022.108507
- Zhang L, Tang Q, Wu Z, Wang F. Mathematical modeling and evolutionary generation of rule sets for energy-efficient flexible job shops. Energy 138:101421 (2017) https://doi.org/10.1016/j.energy.2017.07.005
- Rakovitis N, Li D, Zhang N, Li J, Zhang L, Xiao X. Novel approach to energy-efficient flexible job-shop scheduling problems. Energy 238:121773 (2022) https://doi.org/10.1016/j.energy.2021.121773
- Dai M, Tang D, Giret A, Salido MA. Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints. Robot Comput-Integr Manuf 59:101249 (2019) https://doi.org/10.1016/j.rcim.2019.04.006
- https://doi.org/10.1016/j.rcim.2019.04.006
- Cheng L, Tang Q, Zhang L, Meng K. Mathematical model and enhanced cooperative co-evolutionary algorithm for scheduling energy-efficient manufacturing cell. J Clean Prod 326:129248 (2021) https://doi.org/10.1016/j.jclepro.2021.129248
- Li D, Zheng T, Li J, Teymourifar A. A hybrid framework integrating machine-learning and mathematical programming approaches for sustainable scheduling of flexible job-shop problems. Chem Eng Trans 103:385-390 (2023)
- Gong G, Tang J, Huang D, Luo Q, Zhu K, Peng N. Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility. Swarm Evol Comput 84:101421 (2024) https://doi.org/10.1016/j.swevo.2023.101421
- https://doi.org/10.1016/j.swevo.2023.101421