A mathematical modeling approach for job allocation at STMicroelectronics
EL ACHKAR Elias, FRIGERIO Nicla, PAGANO Daniele, MATTA Andrea
Abstract. The operative management of jobs in semiconductor fabrication plants (FABs) is highly challenging due to the complexity and scale of their processes. Inefficiencies in a FAB can disrupt the entire supply chain, increase production costs, and cause financial losses for downstream industries. This paper focuses on the Process Capacity Planning problem by proposing a novel approach that integrates with existing practices at ST. The method combines a Mixed Integer Linear Programming Model (MILP) with the FAB’s Digital Twin (DT), enhancing the robustness and adaptability of the MILP-generated solution. Numerical validation is conducted on instances derived from the industrial case.
Keywords
Production Planning, Semiconductor, Smart Manufacturing
Published online 9/10/2025, 9 pages
Copyright © 2025 by the author(s)
Published under license by Materials Research Forum LLC., Millersville PA, USA
Citation: EL ACHKAR Elias, FRIGERIO Nicla, PAGANO Daniele, MATTA Andrea, A mathematical modeling approach for job allocation at STMicroelectronics, Materials Research Proceedings, Vol. 57, pp 530-538, 2025
DOI: https://doi.org/10.21741/9781644903735-62
The article was published as article 62 of the book Italian Manufacturing Association Conference
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 license. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.
References
[1] L. Mönch, J. W. Fowler, and S. J. Mason, Production Planning and Control for Semiconductor Wafer Fabrication Facilities, vol. 52. New York, NY: Springer New York, 2013. https://doi.org/10.1007/978-1-4614-4472-5
[2] L. Mönch, R. Uzsoy, and J. W. Fowler, “A survey of semiconductor supply chain models part III: master planning, production planning, and demand fulfilment,” 2018, Taylor and Francis Ltd. https://doi.org/10.1080/00207543.2017.1401234
[3] W. Y. Ku and J. C. Beck, “Mixed Integer Programming models for job shop scheduling: A computational analysis,” Comput Oper Res, 2016. https://doi.org/10.1016/j.cor.2016.04.006
[4] I. Dimény and T. Koltai, “Comparison of MILP and CP models for balancing partially automated assembly lines,” Cent Eur J Oper Res, 2023. https://doi.org/10.1007/s10100-023-00885-x
[5] H. Li, X. Li, and L. Gao, “An iterated greedy algorithm with acceleration of job allocation probability for distributed heterogeneous permutation flowshop scheduling problem,” Swarm Evol Comput, 2024. https://doi.org/10.1016/j.swevo.2024.101580
[6] A. S. Manne, “On the Job-Shop Scheduling Problem,” 1960. Available: https://about.jstor.org/terms
[7] E. F. Stafford, F. T. Tseng, and J. N. D. Gupta, “Comparative evaluation of MILP flowshop models,” Journal of the Operational Research Society, 2005. https://doi.org/10.1057/palgrave.jors.2601805
[8] W. Weng, C. Chu, and P. Wu, “Resource Allocation to Minimize the Makespan with Multi-Resource Operations,” J Syst Sci Complex, 2024. https://doi.org/10.1007/s11424-024-3284-z
[9] S. Werner, S. Horn, G. Weigert, and T. Jahnig, “Simulation Based Scheduling System in a Semiconductor Backend Facility,” Proceedings of the 2006 Winter Simulation Conference, 2006. https://doi.org/10.1109/WSC.2006.322950
[10] G. Weigert, A. Klemmt, and S. Horn, “Design and validation of heuristic algorithms for simulation-based scheduling of a semiconductor Backend facility,” in International Journal of Production Research, 2009. https://doi.org/10.1080/00207540902744784
