A random forest-based job shop rescheduling decision model with machine failures

  • Meng Zhao
  • Liang Gao
  • Xinyu LiEmail author
Original Research


Machine failures are the common disturbances in production scheduling, whose appearances are generally random and uncertain. Rescheduling strategies have been proposed to deal with them. However, performances of these rescheduling strategies depend on status of machine failures, and there is no single strategy for every failure status. Hence, how to select the optimal strategy intelligently when a machine failure occurs becomes an important issue. Since the development of artificial intelligence (AI) and machine learning (ML) techniques, intelligent rescheduling has become possible. In this paper, we propose a new rescheduling decision model based on random forest, an effective machine learning method, to learn the optimal rescheduling strategy in different machine failures. We adopt a genetic algorithm (GA) to generate an initial scheduling scheme. Then we design simulation experiments to obtain data of different machine failures which could influence the initial scheme. In each machine failure, all rescheduling strategies are executed respectively and their performances are evaluated based on delay and deviation, then the best strategy is selected as a label. The random forest is trained based on these data samples with labels. Thus the internal mechanism between machine failures and rescheduling strategies can be learned. We conduct experiments to verify the effectiveness of this proposed method and the results show that accuracy can be as high as 97%. Moreover, compared with decision tree (DT) and support vector machine (SVM), the proposed method illustrates the best performance.


Job shop Machine failure Rescheduling decision Random forest Machine learning (ML) Artificial intelligence (AI) 



This project is supported by the National Natural Science Foundation of China (Grant Nos. 51825502, 51775216 and 51711530038), Natural Science Foundation of Hubei Province (Grant No. 2018CFA078), and Program for HUST Academic Frontier Youth Team (Grant No. 2017QYTD04).


  1. Asadzadeh L (2016) A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy. Comput Ind Eng 102:359–367. CrossRefGoogle Scholar
  2. Bergmann S, Feldkamp N, Strassburger S (2015) Approximation of dispatching rules for manufacturing simulation using data mining methods. In: Paper presented at the 2015 winter simulation conference (WSC)Google Scholar
  3. Bozek A, Wysocki M (2015) Flexible job shop with continuous material flow. Int J Prod Res 53(4):1273–1290. CrossRefGoogle Scholar
  4. Chen W, Xie XS, Wang JL, Pradhan B, Hong HY, Bui DT, Ma JQ (2017) A comparative study of logistic model tree, random forest, and classification and regression tree models for spatial prediction of landslide susceptibility. CATENA 151:147–160. CrossRefGoogle Scholar
  5. Feng QL, Liu JT, Gong JH (2015) Urban flood mapping based on unmanned aerial vehicle remote sensing and random forest classifier-a case of Yuyao, China. Water 7(4):1437–1455. CrossRefGoogle Scholar
  6. Gao KZ, Suganthan PN, Pan QK, Tasgetiren MF, Sadollah A (2016) Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion. Knowl Based Syst 109:1–16. CrossRefGoogle Scholar
  7. Hao PY, Zhan YL, Wang L, Niu Z, Shakir M (2015) Feature selection of time series MODIS data for early crop classification using random forest: a case study in Kansas, USA. Remote Sensing 7(5):5347–5369. CrossRefGoogle Scholar
  8. Hutengs C, Vohland M (2016) Downscaling land surface temperatures at regional scales with random forest regression. Remote Sens Environ 178:127–141. CrossRefGoogle Scholar
  9. Jog A, Carass A, Roy S, Pham DL, Prince JL (2017) Random forest regression for magnetic resonance image synthesis. Med Image Anal 35:475–488. CrossRefGoogle Scholar
  10. Kumar S, Rao CSP (2009) Application of ant colony, genetic algorithm and data mining-based techniques for scheduling. Robot Comput Integr Manufact 25(6):901–908. CrossRefGoogle Scholar
  11. Kundakci N, Kulak O (2016) Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem. Comput Ind Eng 96:31–51. CrossRefGoogle Scholar
  12. Larsson P, Rasmussen LK, Skoglund M (2016) Throughput analysis of hybrid-ARQ -A matrix exponential distribution approach. IEEE Trans Commun 64(1):416–428. CrossRefGoogle Scholar
  13. Li XY, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93–110. CrossRefGoogle Scholar
  14. Li XY, Shao XY, Gao L, Qian WR (2010) An effective hybrid algorithm for integrated process planning and scheduling. Int J Prod Econ 126(2):289–298. CrossRefGoogle Scholar
  15. Li XY, Gao L, Pan Q, Wan L, Chao K (2018a) An effective hybrid genetic algorithm and variable neighborhood search for integrated process planning and scheduling in a packaging machine workshop. IEEE Trans Syst Man Cybern Syst. CrossRefGoogle Scholar
  16. Li XY, Lu C, Gao L, Xiao S, Wen L (2018b) An effective multiobjective algorithm for energy-efficient scheduling in a real-life welding shop. IEEE Trans Ind Inf 14(12):5400–5409. CrossRefGoogle Scholar
  17. Liang X, Huang M, Ning T (2018) Flexible job shop scheduling based on improved hybrid immune algorithm. J Ambient Intell Hum Comput 9(1):165–171. CrossRefGoogle Scholar
  18. Liu LZW (2014) Open shop rescheduling under a common disruptive condition. J Manag Sci Chin 17(06):28–48Google Scholar
  19. Liu LL, Hu RS, Hu XP, Zhao GP, Wang S (2015) A hybrid PSO-GA algorithm for job shop scheduling in machine tool production. Int J Prod Res 53(19):5755–5781. CrossRefGoogle Scholar
  20. Liu L, Chen R-C, Zhao Q, Zhu SJ, Jo AI, Computing H (2018) Applying a multistage of input feature combination to random forest for improving MRT passenger flow prediction. CrossRefGoogle Scholar
  21. Lozano J, Saenz-Diez JC, Martinez E, Jimenez E, Blanco J (2017) Methodology to improve machine changeover performance on food industry based on SMED. Int J Adv Manuf Technol 90(9–12):3607–3618. CrossRefGoogle Scholar
  22. Lytras M, Visvizi A, Sarirete A (2019) Clustering Smart City services: perceptions, expectations, responses. Sustainability 11:1669. CrossRefGoogle Scholar
  23. Nguyen S, Zhang MJ, Johnston M, Tan KC (2014) Automatic design of scheduling policies for dynamic multi-objective job shop scheduling via cooperative coevolution genetic programming. IEEE Trans Evol Comput 18(2):193–208. CrossRefGoogle Scholar
  24. Ning T, Huang M, Liang X, Jin H (2016) A novel dynamic scheduling strategy for solving flexible job-shop problems. J Ambient Intell Hum Comput 7(5):721–729. CrossRefGoogle Scholar
  25. Ning T, Jin H, Song XD, Li B (2018) An improved quantum genetic algorithm based on MAGTD for dynamic FJSP. J Ambient Intell Hum Comput 9(4):931–940. CrossRefGoogle Scholar
  26. Qiao F, Li L, Ma Y, Wang ZT, Shi B (2009) Fuzzy-reasoning-based rescheduling strategy for semiconductor manufacturing (Vol 15)Google Scholar
  27. Rahmati O, Pourghasemi HR, Melesse AM (2016) Application of GIS-based data driven random forest and maximum entropy models for groundwater potential mapping: a case study at Mehran Region, Iran. Catena 137:360–372. CrossRefGoogle Scholar
  28. Rodriguez-Galiano V, Sanchez-Castillo M, Chica-Olmo M, Chica-Rivas M (2015) Machine learning predictive models for mineral prospectivity: an evaluation of neural networks, random forest, regression trees and support vector machines. Ore Geol Rev 71:804–818. CrossRefGoogle Scholar
  29. Salehkaleybar S, Golestani SJ (2016) Distributed binary majority voting via exponential distribution. IET Signal Proc 10(5):532–542. CrossRefGoogle Scholar
  30. Salido MA, Escamilla J, Barber F, Giret A (2017) Rescheduling in job-shop problems for sustainable manufacturing systems. J Cleaner Product 162:S121–S132. CrossRefGoogle Scholar
  31. Sana SS, Ospina-Mateus H, Arrieta FG, Chedid JAJ, Jo AI, Computing H (2018) Application of genetic algorithm to job scheduling under ergonomic constraints in manufacturing industry. CrossRefGoogle Scholar
  32. Spruit M, Lytras M (2018) Applied data science in patient-centric healthcare: adaptive analytic systems for empowering physicians and patients. Telematics Inf 35(4):643–653. CrossRefGoogle Scholar
  33. Van Laarhoven PJM, Aarts EHL, Lenstra JK (1992) Job shop scheduling by simulated annealing. Oper Res 40(1):113. MathSciNetCrossRefzbMATHGoogle Scholar
  34. Wang C, Jiang PY (2018) Manifold learning based rescheduling decision mechanism for recessive disturbances in RFID-driven job shops. J Intell Manuf 29(7):1485–1500. CrossRefGoogle Scholar
  35. Xia H, Li XY, Gao L (2016) A hybrid genetic algorithm with variable neighborhood search for dynamic integrated process planning and scheduling (vol 102)CrossRefGoogle Scholar
  36. Xiong HG, Fan HL, Jiang GZ, Li GF (2017) A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints. Eur J Oper Res 257(1):13–24. MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.The State Key Laboratory of Digital Manufacturing Equipment and TechnologyHuazhong University of Science and TechnologyWuhanChina

Personalised recommendations