Friederich, J. & Lazarova-Molnar, S. Reliability assessment of manufacturing systems: A comprehensive overview, challenges and opportunities. J. Manuf. Syst. 72, 38–58. https://doi.org/10.1016/j.jmsy.2023.11.001 (2024).
Google Scholar
Xu, Y. et al. Hybrid quantum particle swarm optimization and variable neighborhood search for flexible job-shop scheduling problem. J. Manuf. Syst. 73, 334–348. https://doi.org/10.1016/j.jmsy.2024.02.007 (2024).
Google Scholar
Fernandes, J. M. R. C., Homayouni, S. M. & Fontes, D. B. M. M. Energy-efficient scheduling in job shop manufacturing systems: A literature review. Sustainability 14, 6264. https://doi.org/10.3390/su14106264 (2022).
Google Scholar
Lu, H. L., Huang, G. Q. & Yang, H. D. Integrating order review/release and dispatching rules for assembly job shop scheduling using a simulation approach. Int. J. Prod. Res. 49, 647–669. https://doi.org/10.1080/00207540903524490 (2011).
Google Scholar
Thuerer, M. et al. The application of workload control in assembly job shops: An assessment by simulation. Int. J. Prod. Res. 50, 5048–5062. https://doi.org/10.1080/00207543.2011.631600 (2012).
Google Scholar
Zou, P., Rajora, M. & Liang, S. Y. A new algorithm based on evolutionary computation for hierarchically coupled constraint optimization: Methodology and application to assembly job-shop scheduling. J. Sched. 21, 545–563. https://doi.org/10.1007/s10951-018-0572-2 (2018).
Google Scholar
Zhang, S. & Wang, S. Flexible assembly job-shop scheduling with sequence-dependent setup times and part sharing in a dynamic environment: Constraint programming model, mixed-integer programming model, and dispatching rules. IEEE Trans. Eng. Manag. 65, 487–504. https://doi.org/10.1109/TEM.2017.2785774 (2018).
Google Scholar
Nourali, S., Imanipour, N. & Shahriari, M. R. A mathematical model for integrated process planning and scheduling in flexible assembly job shop environment with sequence dependent setup times. Int. J. Math. Anal. 6, 2117–2132 (2012).
Nourali, S. & Imanipour, N. A particle swarm optimization-based algorithm for flexible assembly job shop scheduling problem with sequence dependent setup times. Sci. Iran. Trans. E Ind. Eng. 21, 1021–1033 (2014).
Brucker, P. & Schlie, R. Job-shop scheduling with multipurpose machines. Computing https://doi.org/10.1007/BF02238804 (1990).
Google Scholar
Soto, C. et al. Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm. Swarm Evol. Comput. 53, 100632. https://doi.org/10.1016/j.swevo.2019.100632 (2020).
Google Scholar
Özgüven, C., Özbakır, L. & Yavuz, Y. Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl. Math. Model. 34, 1539–1548. https://doi.org/10.1016/j.apm.2009.09.002 (2010).
Google Scholar
Tian, S. et al. A genetic algorithm with critical path-based variable neighborhood search for distributed assembly job shop scheduling problem. Swarm Evol. Comput. 85, 101485. https://doi.org/10.1016/j.swevo.2024.101485 (2024).
Google Scholar
Nouiri, M. et al. Two stage particle swarm optimization to solve the flexible job shop predictive scheduling problem considering possible machine breakdowns. Comput. Ind. Eng. 112, 595–606. https://doi.org/10.1016/j.cie.2017.03.006 (2017).
Google Scholar
Huang, R. H. & Yu, T. H. An effective ant colony optimization algorithm for multi-objective job-shop scheduling with equal-size lot-splitting. Appl. Soft Comput. 57, 642–656. https://doi.org/10.1016/j.asoc.2017.04.062 (2017).
Google Scholar
Zhu, Z., Zhou, X. & Shao, K. A novel approach based on Neo4j for multi-constrained flexible job shop scheduling problem. Comput. Ind. Eng. 130, 671–686. https://doi.org/10.1016/j.cie.2019.03.022 (2019).
Google Scholar
Zhang, S. et al. Multi-objective optimization in flexible assembly job shop scheduling using a distributed ant colony system. Eur. J. Oper. Res. 283, 441–460. https://doi.org/10.1016/j.ejor.2019.11.016 (2020).
Google Scholar
Cheng, L., Tang, Q. & Zhang, L. Mathematical model and adaptive simulated annealing algorithm for mixed-model assembly job-shop scheduling with lot streaming. J. Manuf. Syst. 70, 484–500. https://doi.org/10.1016/j.jmsy.2023.08.008 (2023).
Google Scholar
Cheng, L., Tang, Q. & Zhang, L. Production costs and total completion time minimization for three-stage mixed-model assembly job shop scheduling with lot streaming and batch transfer. Eng. Appl. Artif. Intell. 130, 107729. https://doi.org/10.1016/j.engappai.2023.107729 (2024).
Google Scholar
Riedmiller, S. & Riedmiller, M. A neural reinforcement learning approach to learn local dispatching policies in production scheduling. IJCAI 2, 764–771 (1999).
Demir, H. I. & Erden, C. Dynamic integrated process planning, scheduling and due-date assignment using ant colony optimization. Comput. Ind. Eng. 149, 106799. https://doi.org/10.1016/j.cie.2020.106799 (2020).
Google Scholar
Fan, J. et al. A matheuristic for flexible job shop scheduling problem with lot-streaming and machine reconfigurations. Int. J. Prod. Res. 61, 6565–6588. https://doi.org/10.1080/00207543.2022.2135629 (2023).
Google Scholar
Zhang, J. D. et al. DeepMAG: Deep reinforcement learning with multi-agent graphs for flexible job shop scheduling. Knowl. Based Syst. 259, 110083. https://doi.org/10.1016/j.knosys.2022.110083 (2023).
Google Scholar
Erden, C., Demir, H. I. & Canpolat, O. A modified integer and categorical PSO algorithm for solving integrated process planning, dynamic scheduling, and due date assignment problem. Sci. Iran. 30, 738–756. https://doi.org/10.24200/SCI.2021.55250.4130 (2023).
Google Scholar
Su, C. et al. Evolution strategies-based optimized graph reinforcement learning for solving dynamic job shop scheduling problem. Appl. Soft Comput. 145, 110596. https://doi.org/10.1016/j.asoc.2023.110596 (2023).
Google Scholar
Fontes, D. B. M. M., Homayouni, S. M. & Gonçalves, J. F. A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources. Eur. J. Oper. Res. 306, 1140–1157. https://doi.org/10.1016/j.ejor.2022.09.006 (2023).
Google Scholar
Burmeister, S. C., Guericke, D. & Schryen, G. A memetic NSGA-II for the multi-objective flexible job shop scheduling problem with real-time energy tariffs. Flex. Serv. Manuf. J. https://doi.org/10.1007/s10696-023-09517-7 (2023).
Google Scholar
Carlucci, D., Renna, P. & Materi, S. A job-shop scheduling decision-making model for sustainable production planning with power constraint. IEEE Trans. Eng. Manag. 70, 1923–1932. https://doi.org/10.1109/TEM.2021.3103108 (2021).
Google Scholar
Liu, C. L., Chang, C. C. & Tseng, C. J. Actor-critic deep reinforcement learning for solving job shop scheduling problems. IEEE Access. 8, 71752–71762. https://doi.org/10.1109/ACCESS.2020.2987820 (2020).
Google Scholar
Yingzi, W. & Mingyang, Z. Composite rules selection using reinforcement learning for dynamic job-shop scheduling robotics. In 2004 IEEE Conference on Automation and Mechatmnics, vol. 2, 1083–1088 (2004).
Luo, S., Zhang, L. & Fan, Y. Real-time scheduling for dynamic partial-no-wait multiobjective flexible job shop by deep reinforcement learning. IEEE Trans. Autom. Sci. Eng. 19, 3020–3038. https://doi.org/10.1109/TASE.2021.3104716 (2021).
Google Scholar
Mouelhi-Chibani, W. & Pierreval, H. Training a neural network to select dispatching rules in real time. Comput. Ind. Eng. 58, 249–256. https://doi.org/10.1016/j.cie.2009.03.008 (2010).
Google Scholar
Song, W. et al. Flexible job-shop scheduling via graph neural network and deep reinforcement learning. IEEE Trans. Ind. Inform. 19, 1600–1610. https://doi.org/10.1109/TII.2022.3189725 (2022).
Google Scholar
Chen, X., Hao, X. C., Lin, H. W. et al. Rule driven multi objective dynamic scheduling by data envelopment analysis and reinforcement learning. In 2010 IEEE International Conference on Automation and Logistics, 396–401 (IEEE¸2010).
Shahrabi, J., Adibi, M. A. & Mahootchi, M. A reinforcement learning approach to parameter estimation in dynamic job shop scheduling. Comput. Ind. Eng. 110, 75–82. https://doi.org/10.1016/j.cie.2017.05.026 (2017).
Google Scholar
Wang, Y. F. Adaptive job shop scheduling strategy based on weighted Q-learning algorithm. J. Intell Manuf. 31, 417–432. https://doi.org/10.1007/s10845-018-1454-3 (2020).
Google Scholar
Shiue, Y. R., Lee, K. C. & Su, C. T. Real-time scheduling for a smart factory using a reinforcement learning approach. Comput. Ind. Eng. 125, 604–614. https://doi.org/10.1016/j.cie.2018.03.039 (2018).
Google Scholar
Che, G. et al. A deep reinforcement learning based multi-objective optimization for the scheduling of oxygen production system in integrated iron and steel plants. Appl. Energy 345, 121332. https://doi.org/10.1016/j.apenergy.2023.121332 (2023).
Google Scholar
Yuan, M. et al. A multi-agent double deep-Q-network based on state machine and event stream for flexible job shop scheduling problem. Adv. Eng. Inform. 58, 102230. https://doi.org/10.1016/j.aei.2023.102230 (2023).
Google Scholar
Bedotti, A., Pastori, M. & Casoli, P. Modelling and energy comparison of system layouts for a hydraulic excavator. Energy Procedia 148, 26–33. https://doi.org/10.1016/j.egypro.2018.08.015 (2018).
Google Scholar
Xu, Z. et al. Energy improvement of fineblanking press by valve-pump combined controlled hydraulic system with multiple accumulators. J. Clean. Prod. 257, 120505. https://doi.org/10.1016/j.jclepro.2020.120505 (2020).
Google Scholar
Moslehi, G. & Mahnam, M. A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int. J. Prod. Econ. 129, 14–22. https://doi.org/10.1016/j.ijpe.2010.08.004 (2011).
Google Scholar
Parveen, S. & Ullah, H. Review on job-shop and flow-shop scheduling using. J. Mech. Eng. 41, 130–146. https://doi.org/10.3329/jme.v41i2.7508 (2010).
Google Scholar
Framinan, J. M., Perez-Gonzalez, P. & Fernandez-Viagas, V. Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures. Eur. J. Oper. Res. 273, 401–417. https://doi.org/10.1016/j.ejor.2018.04.033 (2019).
Google Scholar
Loukil, T., Teghem, J. & Tuyttens, D. Solving multi-objective production scheduling problems using metaheuristics. Eur. J. Oper. Res. 161, 42–61. https://doi.org/10.1016/j.ejor.2003.08.029 (2005).
Google Scholar
Panwalkar, S. S. & Iskander, W. A survey of scheduling rules. Oper. Res. 25, 45–61 (1977).
Google Scholar
Watkins, C. J. C. H. & Dayan, P. Q-learning. Mach. Learn. 8, 279–292 (1992).
Google Scholar
Mnih, V., Kavukcuoglu, K., Silver, D. et al. Playing atari with deep reinforcement learning. arXiv preprint https://arxiv.org/abs/1312.5602 (2013).
Liu, K. et al. SynerFill: A synergistic RGB-D image inpainting network via fast Fourier convolutions. IEEE Trans. Intell. Veh. 9, 69–78. https://doi.org/10.1109/TIV.2023.3326236 (2023).
Google Scholar
Arulkumaran, K., Deisenroth, M. P., Brundage, M. et al. A brief survey of deep reinforcement learning. arXiv preprint https://arxiv.org/abs/1708.05866 (2017).
Sutton, R. S. & Barto, A. G. Reinforcement Learning: An Introduction Vol. 20, 30148–4 (MIT Press, 2018).
Tsitsiklis, J. N. & Van Roy, B. An analysis of temporal-difference learning with function approximation technical. (Rep. LIDS-P-2322). Laboratory for Information and Decision Systems, Massachusetts Institute of Technology Report (1996).
LeCun, Y., Bengio, Y. & Hinton, G. Deep learning. Nature 521, 436–444 (2015).
Google Scholar
Hinton, G. E., Osindero, S. & Teh, Y. W. A fast learning algorithm for deep belief nets. Neural Comput. 18(7), 1527–1554 (2006).
Google Scholar
He, K., Zhang, X., Ren, S. et al. Deep residual learning for image recognition. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 770–778 (2016).
Krizhevsky, A., Sutskever, I. & Hinton, G. E. Imagenet classification with deep convolutional neural networks. In Advances in Neural Information Processing Systems, vol. 25 (2012).
Glorot, X. & Bengio, Y. Understanding the difficulty of training deep feedforward neural networks. In JMLR Workshop and Conference Proceedings, 249–256 (2010).
Duchi, J., Hazan, E. & Singer, Y. Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12, 2121–2159 (2011).
Google Scholar
Kacem, I., Hammadi, S. & Borne, P. Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simul. 60, 245–276. https://doi.org/10.1016/S0378-4754(02)00019-8 (2002).
Google Scholar
Xing, L. N., Chen, Y. W. & Yang, K. W. Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling. Appl. Soft Comput. 9, 362–376. https://doi.org/10.1016/j.asoc.2008.04.013 (2009).
Google Scholar
Li, J., Pan, Q. & Liang, Y. C. An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 59, 647–662. https://doi.org/10.1016/j.cie.2010.07.014 (2010).
Google Scholar
Jiménez, Y. M. A generic multi-agent reinforcement learning approach for scheduling problems. PhD, Vrije Universiteit Brussel, 128 (2012).
Qin, Z., Johnson, D. & Lu, Y. Dynamic production scheduling towards self-organizing mass personalization: A multi-agent dueling deep reinforcement learning approach. J. Comput. Syst. 68, 242–257. https://doi.org/10.1016/j.jmsy.2023.03.003 (2023).
Google Scholar
Brandimarte, P. Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41, 157–183 (1993).
Google Scholar
Gao, J., Sun, L. & Gen, M. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput. Oper. Res. 35(9), 2892–2907. https://doi.org/10.1016/j.cor.2007.01.001 (2008).
Google Scholar
Mastrolilli, M. & Gambardella, L. M. Effective neighbourhood functions for the flexible job shop problem. J. Sched. 3, 3–20. https://doi.org/10.1002/(SICI)1099-1425 (2000).
Google Scholar
Sun, J. et al. A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times. Comput. Oper. Res. 132, 105263. https://doi.org/10.1016/j.cor.2021.105263 (2021).
Google Scholar
Reddy, M. B. S. S. et al. An effective hybrid multi objective evolutionary algorithm for solving real time event in flexible job shop scheduling problem. Measurement 114, 78–90. https://doi.org/10.1016/j.measurement.2017.09.022 (2018).
Google Scholar
Huang, S. et al. Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization. SpringerPlus 5, 1–22. https://doi.org/10.1186/s40064-016-3054-z (2016).
Google Scholar
Aydin, M. E. & Öztemel, E. Dynamic job-shop scheduling using reinforcement learning agents. Robot. Auton. Syst. 33, 169–178. https://doi.org/10.1016/S0921-8890(00)00087-7 (2000).
Google Scholar
Li, X., Wang, J. & Sawhney, R. Reinforcement learning for joint pricing, lead-time and scheduling decisions in make-to-order systems. Eur. J. Oper. Res. 221, 99–109. https://doi.org/10.1016/j.ejor.2012.03.020 (2012).
Google Scholar
Wang, Y. F. Adaptive job shop scheduling strategy based on weighted Q-learning algorithm. J. Intell. Manuf. 31, 417–432. https://doi.org/10.1007/s10845-018-1454-3 (2020).
Google Scholar
