A Hybrid NSGA-II for Delivery-Carbon Bi-objective Flexible Job Shop Scheduling of Electric Motor Housing Machining with Fixture and Inspection Constraints

Authors

Keywords:

Flexible job-shop scheduling, Motor housing, Total weighted tardiness, Carbon emissions, Fixture constraints, Final inspection, NSGA-II

Abstract

Precision machining of new-energy vehicle motor housings requires coordinated decisions on flexible machines, processing modes, limited fixtures, sequence-dependent setup, transport, and mandatory final inspection. A bi-objective flexible job-shop model is formulated to minimize total weighted tardiness and carbon emissions. Its energy account includes processing, setup, machine idling, transport, and inspection, and fixtures remain occupied throughout datum-retention blocks. The proposed HILS-NSGA-II uses an OS-MMS-FPA representation, a common serial decoder, hybrid initialization, and probabilistic Pareto local search. Gurobi experiments on small instances verify feasibility and objective calculations. Tests on 30 instances from six scale groups compare the method with NSGA-II, SPEA2, and MOPSO. Mean HV is 3.70% and 4.28% higher than that of NSGA-II and SPEA2, and mean IGD is 31.36% and 35.74% lower. Ablation results attribute most of the gain to hybrid initialization, with a smaller complementary contribution from local search. Due-date tightness has the largest effect on tardiness in the production sensitivity analysis. Fixture availability and final-inspection efficiency also alter waiting and completion performance when those resources are restrictive. The resulting nondominated sets provide delivery-oriented, low-carbon, and compromise schedules for motor-housing production. 

Downloads

Download data is not yet available.

References

International Energy Agency. (2026). Global EV Outlook 2026. IEA. https://www.iea.org/reports/global-ev-outlook-2026

Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41(3), 157–183. https://doi.org/10.1007/bf02023073

Dauzère-Pérès, S., Ding, J., Shen, L., & Tamssaouet, K. (2024). The flexible job shop scheduling problem: A review. European Journal of Operational Research, 314(2), 409–432. https://doi.org/10.1016/j.ejor.2023.05.017

Gahm, C., Denz, F., Dirr, M., & Tuma, A. (2016). Energy-efficient scheduling in manufacturing companies: A review and research framework. European Journal of Operational Research, 248(3), 744–757. https://doi.org/10.1016/j.ejor.2015.07.017

Liu, Y., Dong, H., Lohse, N., Petrovic, S., & Gindy, N. (2014). An investigation into minimising total energy consumption and total weighted tardiness in job shops. Journal of Cleaner Production, 65, 87–96. https://doi.org/10.1016/j.jclepro.2013.07.060

Zhang, R., & Chiong, R. (2016). Solving the energy-efficient job shop scheduling problem: A multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption. Journal of Cleaner Production, 112, 3361–3375. https://doi.org/10.1016/j.jclepro.2015.09.097

Yin, L., Li, X., Gao, L., Lu, C., & Zhang, Z. (2017). Energy-efficient job shop scheduling problem with variable spindle speed using a novel multi-objective algorithm. Advances in Mechanical Engineering, 9(4). https://doi.org/10.1177/1687814017695959

Shen, L., Dauzère-Pérès, S., & Neufeld, J. S. (2018). Solving the flexible job shop scheduling problem with sequence-dependent setup times. European Journal of Operational Research, 265(2), 503–516. https://doi.org/10.1016/j.ejor.2017.08.021

Wu, X., Peng, J., Xiao, X., & Wu, S. (2021). An effective approach for the dual-resource flexible job shop scheduling problem considering loading and unloading. Journal of Intelligent Manufacturing, 32(3), 707–728. https://doi.org/10.1007/s10845-020-01697-5

Zhou, Y., Du, S., Liu, M., & Shen, X. (2024). Machine-fixture-pallet resources constrained flexible job shop scheduling considering loading and unloading times under pallet automation system. Journal of Manufacturing Systems, 73, 143–158. https://doi.org/10.1016/j.jmsy.2024.01.010

Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182–197. https://doi.org/10.1109/4235.996017

Li, X., Guo, X., Tang, H., Wu, R., Wang, L., Pang, S., Liu, Z., Xu, W., & Li, X. (2022). Survey of integrated flexible job shop scheduling problems. Computers & Industrial Engineering, 174, 108786. https://doi.org/10.1016/j.cie.2022.108786

Meng, L., Zhang, C., Shao, X., & Ren, Y. (2019). MILP models for energy-aware flexible job shop scheduling problem. Journal of Cleaner Production, 210, 710–723. https://doi.org/10.1016/j.jclepro.2018.11.021

Rossi, A., & Dini, G. (2007). Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method. Robotics and Computer-Integrated Manufacturing, 23(5), 503–516. https://doi.org/10.1016/j.rcim.2006.06.004

Liu, M., Lv, J., Du, S., Deng, Y., Shen, X., & Zhou, Y. (2024). Multi-resource constrained flexible job shop scheduling problem with fixture-pallet combinatorial optimisation. Computers & Industrial Engineering, 188, 109903. https://doi.org/10.1016/j.cie.2024.109903

Zhu, K., Gong, G., Peng, N., Zhang, L., Huang, D., Luo, Q., & Li, X. (2023). Dynamic distributed flexible job-shop scheduling problem considering operation inspection. Expert Systems with Applications, 224, 119840. https://doi.org/10.1016/j.eswa.2023.119840

Mokhtari, H., & Hasani, A. (2017). An energy-efficient multi-objective optimization for flexible job-shop scheduling problem. Computers & Chemical Engineering, 104, 339–352. https://doi.org/10.1016/j.compchemeng.2017.05.004

Wu, X., & Sun, Y. (2018). A green scheduling algorithm for flexible job shop with energy-saving measures. Journal of Cleaner Production, 172, 3249–3264. https://doi.org/10.1016/j.jclepro.2017.10.342

Dai, M., Tang, D., Giret, A., & Salido, M. A. (2019). Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints. Robotics and Computer-Integrated Manufacturing, 59, 143–157. https://doi.org/10.1016/j.rcim.2019.04.006

Wei, Z., Liao, W., & Zhang, L. (2022). Hybrid energy-efficient scheduling measures for flexible job-shop problem with variable machining speeds. Expert Systems with Applications, 197, 116785. https://doi.org/10.1016/j.eswa.2022.116785

Du, Y., Li, J., Li, C., & Duan, P. (2024). A reinforcement learning approach for flexible job shop scheduling problem with crane transportation and setup times. IEEE Transactions on Neural Networks and Learning Systems, 35(4), 5695–5709. https://doi.org/10.1109/tnnls.2022.3208942

Zitzler, E., Laumanns, M., & Thiele, L. (2001). SPEA2: Improving the strength Pareto evolutionary algorithm (TIK Report No. 103). ETH Zurich, Computer Engineering and Networks Laboratory. https://doi.org/10.3929/ethz-a-004284029

Coello, C. A. C., Pulido, G. T., & Lechuga, M. S. (2004). Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation, 8(3), 256–279. https://doi.org/10.1109/tevc.2004.826067

Zhou, H., Cheung, W., & Leung, L. C. (2009). Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm. European Journal of Operational Research, 194(3), 637–649. https://doi.org/10.1016/j.ejor.2007.10.063

Luan, F., Zhao, H., Liu, S. Q., He, Y., & Tang, B. (2023). Enhanced NSGA-II for multi-objective energy-saving flexible job shop scheduling. Sustainable Computing: Informatics and Systems, 39, 100901. https://doi.org/10.1016/j.suscom.2023.100901

Melnyk, S. A., Ghosh, S., & Ragatz, G. L. (1989). Tooling constraints and shop floor scheduling: A simulation study. Journal of Operations Management, 8(2), 69–89. https://doi.org/10.1016/0272-6963(89)90013-2

Kasapidis, G. A., Paraskevopoulos, D. C., Mourtos, I., & Repoussis, P. P. (2025). A unified solution framework for flexible job shop scheduling problems with multiple resource constraints. European Journal of Operational Research, 320(3), 479–495. https://doi.org/10.1016/j.ejor.2024.08.010

Jaszkiewicz, A. (2002). Genetic local search for multi-objective combinatorial optimization. European Journal of Operational Research, 137(1), 50–71. https://doi.org/10.1016/s0377-2217(01)00104-7

Gong, X., De Pessemier, T., Martens, L., & Joseph, W. (2019). Energy- and labor-aware flexible job shop scheduling under dynamic electricity pricing: A many-objective optimization investigation. Journal of Cleaner Production, 209, 1078–1094. https://doi.org/10.1016/j.jclepro.2018.10.289

Published

2026-08-13

How to Cite

Wan, J., & Kong, M. (2026). A Hybrid NSGA-II for Delivery-Carbon Bi-objective Flexible Job Shop Scheduling of Electric Motor Housing Machining with Fixture and Inspection Constraints. Computers & Intelligent Decision Applications, 1(1), 27-68. https://cidai-journal.org/journal/article/view/313