Optimization model for flexible flow shop scheduling problem: Case study of telecommunication equipment industry


Authors

  • Nguyen Phuong Anh School of Economics and Management - Hanoi University of Science and Technology
  • Nguyen Thi Xuan Hoa School of Economics and Management - Hanoi University of Science and Technology
  • Tran Thi Bich Ngoc School of Economics and Management - Hanoi University of Science and Technology https://orcid.org/0000-0003-2184-3907
DOI: https://doi.org/10.57110/vnu-jeb.v5i6.379

Keywords:

Production scheduling, flexible flow shop, genetic algorithm, telecommunication equipment manufacturer

Abstract

The flexible flow shop (FFS) scheduling problem represents a critical challenge in optimizing production processes, especially within the telecommunication equipment manufacturing (TEM) sector. Effective scheduling is important for minimizing production time, reducing costs, and ensuring timely delivery. Through extensive research on related work in FFS scheduling problems and the algorithms used to address this complex issue, a significant research gap has been identified. There is an increasing need for multi-objective models and application studies that can address the unique constraints and requirements of modern manufacturing environments. This study proposed an optimization approach for solving FFS scheduling problems by using genetic algorithm (GA), aiming at optimizing two primary objectives: makespan and job tardiness. The model considers workforce constraint, due date constraint and job sequencing. By employing an optimization model and a GA, an optimized scheduling model has been developed to meet the specific requirements of the company in TEM sector. The optimized scheduling model resulted in a significant reduction in makespan, improving the overall production timeline. Additionally, the model enhanced resource utilization, ensuring that machines and workforce are employed more efficiently. Particularly, the optimized scheduling model helped decrease the makespan by 33% and eliminate job tardiness.

References

Aqil, S., & Allali, K. (2021). Two efficient nature inspired meta-heuristics solving blocking hybrid flow shop manufacturing problem. Engineering Applications of Artificial Intelligence, 100. https://doi.org/10.1016/j.engappai.2021.104196

Chabhadia, N., Jain, P., & Doshi, S. (2024). A review on digital manufacturing systems. AIP Conference Proceedings, 3013(1), 020010. https://doi.org/10.1063/5.0202021

Chang, P. C., Hsieh, J. C., & Wang, C. Y. (2007). Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry. Applied Soft Computing, 7(3), 800–806. https://doi.org/10.1016/J.ASOC.2006.02.002

Chen, D., & Zhao, X. R. (2021). Production management of hybrid flow shop based on genetic algorithm. International Journal of Simulation Modelling, 20(3), 571–582. https://doi.org/10.2507/IJSIMM20-3-CO12

Chu, F., Liu, M., Liu, X., Chu, C., & Jiang, J. (2018). Reentrant Flow Shop Scheduling considering Multiresource Qualification Matching. Scientific Programming, 2018. https://doi.org/10.1155/2018/2615096

Çolak, M., & Keskin, G. A. (2022). An extensive and systematic literature review for hybrid flowshop scheduling problems. In International Journal of Industrial Engineering Computations (Vol. 13, Issue 2, pp. 185–222). Growing Science. https://doi.org/10.5267/J.IJIEC.2021.12.001

Costa, A., Fernandez-Viagas, V., & Framinan, J. M. (2020). Solving the hybrid flow shop scheduling problem with limited human resource constraint. Computers & Industrial Engineering, 146, 106545. https://doi.org/10.1016/J.CIE.2020.106545

Guan, Y., Chen, Y., Gan, Z., Zou, Z., Ding, W., Zhang, H., Liu, Y., & Ouyang, C. (2023). Hybrid flow-shop scheduling in collaborative manufacturing with a multi-crossover-operator genetic algorithm. Journal of Industrial Information Integration, 36, 100514. https://doi.org/10.1016/J.JII.2023.100514

Kerdsiri, S., Aramkul, S., & Champrasert, P. (2019). Fatigue Consideration optimization Model for Employee Allocation in Flow Shop Scheduling Problems. 2019 IEEE 6th International Conference on Industrial Engineering and Applications (ICIEA), 898–902. https://doi.org/10.1109/IEA.2019.8714919

King, P. L., Jacob, M., & Peberdy, N. (2023). Production Scheduling for the Process Industries. Productivity Press. https://doi.org/10.4324/9781003304067

Li, Y., Li, X., Gao, L., & Meng, L. (2020). An improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times. Computers & Industrial Engineering, 147, 106638. https://doi.org/10.1016/J.CIE.2020.106638

Liu, M., Yang, X., Chu, F., Zhang, J., & Chu, C. (2020). Energy-oriented bi-objective optimization for the tempered glass scheduling. Omega, 90, 101995. https://doi.org/10.1016/J.OMEGA.2018.11.004

Lu, H., & Qiao, F. (2022). An efficient adaptive genetic algorithm for energy saving in the hybrid flow shop scheduling with batch production at last stage. Expert Systems, 39(2). https://doi.org/10.1111/exsy.12678

Mohammad, S., Hosseini, H., Behroozi, F., & Hasani, A. (2021). Minimizing the Operational Costs in a Flexible Flow Shop Scheduling Problem with Unrelated Parallel Machines. Journal of Optimization in Industrial Engineering, 14, 169–184. https://doi.org/10.22094/JOIE.2021.1890852.1718

Neufeld, J. S., Schulz, S., & Buscher, U. (2023). A systematic review of multi-objective hybrid flow shop scheduling. European Journal of Operational Research, 309(1), 1–23. https://doi.org/10.1016/J.EJOR.2022.08.009

Qin, H., Li, T., Teng, Y., & Wang, K. (2021). Integrated production and distribution scheduling in distributed hybrid flow shops. Memetic Computing, 13(2), 185–202. https://doi.org/10.1007/s12293-021-00329-6

Shao, Z., Shao, W., & Pi, D. (2020). Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem. Swarm and Evolutionary Computation, 59, 100747. https://doi.org/10.1016/J.SWEVO.2020.100747

Shen, K., De Pessemier, T., Martens, L., & Joseph, W. (2021). A parallel genetic algorithm for multi-objective flexible flowshop scheduling in pasta manufacturing. Computers & Industrial Engineering, 161, 107659. https://doi.org/10.1016/J.CIE.2021.107659

Xu, W., Sun, H. Y., Awaga, A. L., Yan, Y., & Cui, Y. J. (2022). Optimization approaches for solving production scheduling problem: A brief overview and a case study for hybrid flow shop using genetic algorithms. Advances in Production Engineering & Management, 17(1), 45–56. https://doi.org/10.14743/apem2022.1.420

Zhang, B., Pan, Q. ke, Meng, L. lei, Lu, C., Mou, J. hui, & Li, J. qing. (2022). An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots. Knowledge-Based Systems, 238, 107819. https://doi.org/10.1016/J.KNOSYS.2021.107819

Zhang, G., Hu, Y., Sun, J., & Zhang, W. (2020). An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints. Swarm and Evolutionary Computation, 54, 100664. https://doi.org/10.1016/J.SWEVO.2020.100664

Downloads

Download data is not yet available.

Published

25-12-2025

Abstract View

9

PDF Downloaded

How to Cite

Nguyen Phuong Anh, Nguyen Thi Xuan Hoa, & Tran Thi Bich Ngoc. (2025). Optimization model for flexible flow shop scheduling problem: Case study of telecommunication equipment industry. VNU University of Economics and Business, 5(6). https://doi.org/10.57110/vnu-jeb.v5i6.379

Issue

Vol. 5 No. 6

Section

Original Articles

License

Copyright (c) 2025 Nguyen Phuong Anh, Nguyen Thi Xuan Hoa, Tran Thi Bich Ngoc

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

by VNU Journal of Economics and Business

Most read articles by the same author(s)