Advertisement

Soft Computing

, Volume 23, Issue 21, pp 11107–11122 | Cite as

A data mining approach for population-based methods to solve the JSSP

  • Mohammad Mahdi NasiriEmail author
  • Sadegh Salesi
  • Ali Rahbari
  • Navid Salmanzadeh Meydani
  • Mojtaba Abdollai
Methodologies and Application

Abstract

Up to now, many different methods (e.g., dispatching rules, metaheuristics) have been proposed to solve the job shop scheduling problem (JSSP), but the application of data mining approaches in the literature is limited. In this paper, we propose a data mining-based approach to generate an improved initial population for population-based heuristics/metaheuristics solving the JSSP. First, we apply a combination of ‘attribute-oriented induction’ and ‘association rule mining’ techniques to extract the rules behind the optimal or near-optimal schedules of JSSP. Then, a novel method called ‘Assignment Procedure’ is proposed to heuristically solve the JSSP using the extracted rules. The proposed method is able to generate numerous schedules for a given JSSP instance, and consequently, the generated solutions can be considered as the initial population for population-based solution methods. To evaluate the effectiveness of the proposed method, the two well-known metaheuristics are considered, i.e., genetic algorithm (GA) and particle swarm optimization (PSO). Extensive experiments were carried out on 35 benchmark problem instances, and Friedman test with post hoc Nemenyi test was performed to statistically analyze the results. The results revealed that using the initial populations generated by the proposed approach is very promising compared to the randomly generated population for both GA and PSO. Moreover, the experiments verify the significant amount of FEs that can be saved using the proposed approach and the superiority of the proposed method in comparison with the method of Koonce and Tsai (Comput Ind Eng 38:361–374, 2000) and four well-known dispatching rules in the literature.

Keywords

Scheduling Job shop Data mining Population generation Particle swarm optimization Genetic algorithm 

Notes

Acknowledgements

The author would like to thank the editor and reviewers for their valuable comments and suggestions which helped to improve the paper.

Compliance with ethical standards

Conflict of interest

All authors declare that they have no conflict of interest.

Supplementary material

500_2018_3663_MOESM1_ESM.docx (593 kb)
Supplementary material 1 (DOCX 592 kb)

References

  1. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference very large data bases, VLDB, pp 487–499Google Scholar
  2. Agrawal R, Imieliński T, Swami A (1993) Mining association rules between sets of items in large databases. ACM Sigmod Rec 2:207–216CrossRefGoogle Scholar
  3. Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem ORSA. J Comput 3:149–156zbMATHGoogle Scholar
  4. Arroyo JEC, Leung JYT (2017) An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Comput Ind Eng 105:84–100.  https://doi.org/10.1016/j.cie.2016.12.038 CrossRefGoogle Scholar
  5. Asadzadeh L (2015) A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Comput Ind Eng 85:376–383CrossRefGoogle Scholar
  6. Beck JC, Feng T, Watson J-P (2011) Combining constraint programming and local search for job-shop scheduling. INFORMS J Comput 23:1–14MathSciNetCrossRefGoogle Scholar
  7. Belz R, Mertens P (1996) Combining knowledge-based systems and simulation to solve rescheduling problems. Decis Support Syst 17:141–157CrossRefGoogle Scholar
  8. Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the 6th international symposium on micro machine and human science, New York, pp 39–43Google Scholar
  9. Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. Ind Sched 3:225–251Google Scholar
  10. Gao KZ, Suganthan PN, Pan QK, Chua TJ, Cai TX, Chong CS (2016) Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J Intell Manuf 27:363–374.  https://doi.org/10.1007/s10845-014-0869-8 CrossRefGoogle Scholar
  11. Garey MR, Johnson DS (1979) Computers and intractability, vol 174. Freeman, San FranciscozbMATHGoogle Scholar
  12. Gonçalves JF, Resende MG (2011) A biased random-key genetic algorithm for job-shop scheduling. AT&T Labs Research Technical Report, Florham Park, p 7932Google Scholar
  13. Han J, Fu Y (1994) Dynamic generation and refinement of concept hierarchies for knowledge discovery in databases. In: KDD workshop, pp 157–168Google Scholar
  14. Han J, Fu Y (1995) Discovery of multiple-level association rules from large databases. In: VLDB, pp 420–431Google Scholar
  15. Han J, Cai Y, Cercone N (1993a) Data-driven discovery of quantitative rules in relational databases. IEEE Trans Knowl Data Eng 5:29–40CrossRefGoogle Scholar
  16. Han J, Cai Y, Cercone N, Huang Y (1993b) Discovery of data evolution regularities in large databases. J Comput Softw Eng 14:1–29Google Scholar
  17. Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press, Ann ArborzbMATHGoogle Scholar
  18. Huyet A-L (2006) Optimization and analysis aid via data-mining for simulated production systems. Eur J Oper Res 173:827–838MathSciNetCrossRefGoogle Scholar
  19. José Palacios J, González-Rodríguez I, Vela CR, Puente J (2017) Robust multiobjective optimisation for fuzzy job shop problems. Appl Soft Comput 56:604–616.  https://doi.org/10.1016/j.asoc.2016.07.004 CrossRefGoogle Scholar
  20. Karimi H, Rahmati SHA, Zandieh M (2012) An efficient knowledge-based algorithm for the flexible job shop scheduling problem. Knowl-Based Syst 36:236–244CrossRefGoogle Scholar
  21. Koonce D, Tsai S-C (2000) Using data mining to find patterns in genetic algorithm solutions to a job shop schedule. Comput Ind Eng 38:361–374CrossRefGoogle Scholar
  22. Kumar S, Rao C (2009) Application of ant colony, genetic algorithm and data mining-based techniques for scheduling. Robot Comput Integr Manuf 25:901–908CrossRefGoogle Scholar
  23. Kurdi M (2016) An effective new island model genetic algorithm for job shop scheduling problem. Comput Oper Res 67:132–142MathSciNetCrossRefGoogle Scholar
  24. Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Graduate School of Industrial Administration, Carnegie-Mellon University, PittsburghGoogle Scholar
  25. Li X, Olafsson S (2005) Discovering dispatching rules using data mining. J Sched 8:515–527MathSciNetCrossRefGoogle Scholar
  26. Li D-C, Wu C-S, Tsai T-I, Chang FM (2006) Using mega-fuzzification and data trend estimation in small data set learning for early FMS scheduling knowledge. Comput Oper Res 33:1857–1869CrossRefGoogle Scholar
  27. Liu Y-H, Huang H-P, Lin Y-S (2005) Attribute selection for the scheduling of flexible manufacturing systems based on fuzzy Set-theoretic approach and genetic algorithm. J Chin Inst Ind Eng 22:46–55Google Scholar
  28. Meng Q, Zhang L, Fan Y (2016) A hybrid particle swarm optimization algorithm for solving job shop scheduling problems. In: Asian simulation conference. Springer, pp 71–78Google Scholar
  29. Mirshekarian S, Šormaz DN (2016) Correlation of job-shop scheduling problem features with scheduling efficiency. Expert Syst Appl 62:131–147CrossRefGoogle Scholar
  30. Mishra S, Bose P, Rao C (2017) An invasive weed optimization approach for job shop scheduling problems. Int J Adv Manuf Technol 58:1–9Google Scholar
  31. Nasiri MM (2013) A pseudo particle swarm optimization for the RCPSP. Int J Adv Manuf Technol 65:909–918CrossRefGoogle Scholar
  32. Nasiri MM, Kianfar F (2012a) A GES/TS algorithm for the job shop scheduling. Comput Ind Eng 62:946–952CrossRefGoogle Scholar
  33. Nasiri MM, Kianfar F (2012b) A guided tabu search/path relinking algorithm for the job shop problem. Int J Adv Manuf Technol 58:1105–1113CrossRefGoogle Scholar
  34. Nasiri MM, Yazdanparast R, Jolai F (2017) A simulation optimisation approach for real-time scheduling in an open shop environment using a composite dispatching rule. Int J Comput Integr Manuf 30:1239–1252CrossRefGoogle Scholar
  35. Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manag Sci 42:797–813CrossRefGoogle Scholar
  36. Park J, Mei Y, Nguyen S, Chen G, Zhang M (2018) An investigation of ensemble combination schemes for genetic programming based hyper-heuristic approaches to dynamic job shop scheduling. Appl Soft Comput 63:72–86.  https://doi.org/10.1016/j.asoc.2017.11.020 CrossRefGoogle Scholar
  37. Peng B, Lü Z, Cheng T (2015) A tabu search/path relinking algorithm to solve the job shop scheduling problem. Comput Oper Res 53:154–164MathSciNetCrossRefGoogle Scholar
  38. Shahzad A, Mebarki N (2012) Data mining based job dispatching using hybrid simulation-optimization approach for shop scheduling problem. Eng Appl Artif Intell 25:1173–1181CrossRefGoogle Scholar
  39. Shen X-N, Han Y, Fu J-Z (2017) Robustness measures and robust scheduling for multi-objective stochastic flexible job shop scheduling problems. Soft Comput 21:6531–6554CrossRefGoogle Scholar
  40. Sprecher A, Kolisch R, Drexl A (1995) Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. Eur J Oper Res 80:94–102CrossRefGoogle Scholar
  41. Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing problems with application to job shop scheduling. Manag Sci 38:1495–1509CrossRefGoogle Scholar
  42. Sundar S, Suganthan PN, Jin CT, Xiang CT, Soon CC (2017) A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput 21:1193–1202CrossRefGoogle Scholar
  43. Veček N, Črepinšek M, Mernik M (2017) On the influence of the number of algorithms, problems, and independent runs in the comparison of evolutionary algorithms. Appl Soft Comput 54:23–45.  https://doi.org/10.1016/j.asoc.2017.01.011 CrossRefGoogle Scholar
  44. Wang X, Duan H (2014) A hybrid biogeography-based optimization algorithm for job shop scheduling problem. Comput Ind Eng 73:96–114CrossRefGoogle Scholar
  45. Wang Y, Ji D (2015) Data-and rule-based integrated mechanism for job shop scheduling. Int J Comput Commu Eng 4:180CrossRefGoogle Scholar
  46. Wang C, Rong G, Weng W, Feng Y (2015) Mining scheduling knowledge for job shop scheduling problem. IFAC-PapersOnLine 48:800–805CrossRefGoogle Scholar
  47. Wang L, Cai J-C, Li M (2016) An adaptive multi-population genetic algorithm for job-shop scheduling problem. Adv Manuf 4:1–8CrossRefGoogle Scholar
  48. Wang B, Wang X, Lan F, Pan Q (2018) A hybrid local-search algorithm for robust job-shop scheduling under scenarios. Appl Soft Comput 62:259–271CrossRefGoogle Scholar
  49. Weckman GR, Ganduri CV, Koonce DA (2008) A neural network job-shop scheduler. J Intell Manuf 19:191–201CrossRefGoogle Scholar
  50. Zare HK, Fakhrzad MB (2011) Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: a fuzzy approach. Expert Syst Appl 38:7609–7615CrossRefGoogle Scholar
  51. Zhang C, Li P, Guan Z, Rao Y (2007) A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput Oper Res 34:3229–3242MathSciNetCrossRefGoogle Scholar
  52. Zhang CY, Li P, Rao Y, Guan Z (2008) A very fast TS/SA algorithm for the job shop scheduling problem. Comput Oper Res 35:282–294MathSciNetCrossRefGoogle Scholar
  53. Zhang R, Song S, Wu C (2013) A hybrid artificial bee colony algorithm for the job shop scheduling problem. Int J Prod Econ 141:167–178CrossRefGoogle Scholar
  54. Zhao F, Tang J, Wang J (2014) An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem. Comput Oper Res 45:38–50MathSciNetCrossRefGoogle Scholar
  55. Zhao F, Zhang J, Zhang C, Wang J (2015) An improved shuffled complex evolution algorithm with sequence mapping mechanism for job shop scheduling problems. Expert Syst Appl 42(8):3953–3966CrossRefGoogle Scholar

Copyright information

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

Authors and Affiliations

  1. 1.School of Industrial Engineering, College of EngineeringUniversity of TehranTehranIran
  2. 2.Department of Industrial Engineering, Alborz CampusUniversity of TehranTehranIran
  3. 3.Department of Industrial EngineeringAmirkabir University of TechnologyTehranIran

Personalised recommendations