Abstract
In production planning and scheduling, data mining methods can be applied to transform the scheduling data into useful knowledge that can be used to improve planning/scheduling by enabling real-time decision-making. In this paper, a novel approach combining dispatching rules, a genetic algorithm, data mining, and simulation is proposed. The genetic algorithm (i) is used to solve scheduling problems, and the obtained solutions (ii) are analyzed in order to extract knowledge, which is then used (iii) to automatically assign in real-time different dispatching rules to machines based on the jobs in their respective queues. The experiments are conducted on a job shop scheduling problem with a makespan criterion. The obtained results from the computational study show that the proposed approach is a viable and effective approach for solving the job shop scheduling problem in real time.
Similar content being viewed by others
References
Baykasoğlu, A., Göçken, M., Özbakır, L., & Kulluk, S. (2008). Composite dispatching rule generation through data mining in a simulated job shop. Modelling, computation and optimization in information systems and management sciences (pp. 389–398). New York: Springer.
Beasley, J. E. (1990). Or-library: Distributing test problems by electronic mail. The Journal of the Operational Research Society, 41(11), 1069.
Bülbül, K., & Kaminsky, P. (2013). A linear programming-based method for job shop scheduling. Journal of Scheduling, 16(2), 161–183.
Çaliş, B., & Bulkan, S. (2015). A research survey: Review of ai solution strategies of job shop scheduling problem. Journal of Intelligent Manufacturing, 26(5), 961–973.
Cao, Y., & Shi, H. (2015). A hybrid ant colony optimisation algorithm for job shop problems and its convergence analysis. International Journal of Modelling, Identification and Control, 23(3), 230–237.
Chaudhry, I. A., & Khan, A. A. (2016). A research survey: Review of flexible job shop scheduling techniques. International Transactions in Operational Research, 23(3), 551–591.
Chen, B., & Matis, T. I. (2013). A flexible dispatching rule for minimizing tardiness in job shop scheduling. International Journal of Production Economics, 141(1), 360–365.
Cheng, T., Peng, B., & Lü, Z. (2016). A hybrid evolutionary algorithm to solve the job shop scheduling problem. Annals of Operations Research, 242(2), 223–237.
Chiang, P. H., & Torng, C. C. (2016). A production planning and optimisation of multi-mode job shop scheduling problem for an avionics manufacturing plant. International Journal of Manufacturing Technology and Management, 30(3–4), 179–195.
da Silva, E. B., Costa, M. G., da Silva, M Fd S, & Pereira, F. H. (2014). Simulation study of dispatching rules in stochastic job shop dynamic scheduling. World Journal of Modelling and Simulation, 10(3), 231–240.
Demirkol, E., Sanjay, M., & Reha, U. (1998). Benchmarks for shop scheduling problems. European Journal of Operational Research, 109(1), 137–141.
Geiger, C. D., Uzsoy, R., & Aytuğ, H. (2006). Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach. Journal of Scheduling, 9(1), 7–34.
Habib Zahmani, M., & Atmani, B. (2018). Extraction of dispatching rules for single machine total weighted tardiness using a modified genetic algorithm and data mining. International Journal of Manufacturing Research, 13(1), 1–25.
Habib Zahmani, M., Atmani, B., Bekrar, A., & Aissani, N. (2015a). Multiple priority dispatching rules for the job shop scheduling problem. In: 2015 3rd International Conference on Control, Engineering and Information Technology (CEIT), IEEE, (pp. 1–6)
Habib Zahmani, M., Atmani, B., Bekrar, A., & Aissani, N. (2015b). A real time data mining rules selection model for the job shop scheduling problem. In 45th international conference on computers and industrial engineering 2015 (CIE45) (pp. 465–472)
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009). The weka data mining software: An update. ACM SIGKDD Explorations Newsletter, 11(1), 10–18.
Hasan, S. K., Sarker, R., & Essam, D. (2010). Evolutionary scheduling with rescheduling option for sudden machine breakdowns. In: IEEE congress on evolutionary computation (CEC) IEEE (pp. 1–8).
Hasan, S. K., Sarker, R., & Essam, D. (2011). Genetic algorithm for job-shop scheduling with machine unavailability and breakdowns. International Journal of Production Research, 49(16), 4999–5015.
Holland, J. (1975). Adaption in natural and artificial systems. Ann Arbor, MI: The University of Michigan Press.
Kaban, A., Othman, Z., & Rohmah, D. (2012). Comparison of dispatching rules in job-shop scheduling problem using simulation: A case study. International Journal of Simulation Modelling, 11(3), 129–140.
Kacem, I. (2003). Genetic algorithm for the flexible job-shop scheduling problem. In IEEE international conference on systems, man and cybernetics, 2003, IEEE, vol 4, pp. 3464–3469
Kaplanoğlu, V. (2016). An object-oriented approach for multi-objective flexible job-shop scheduling problem. Expert Systems with Applications, 45, 71–84.
Karthikeyan, S., Asokan, P., Nickolas, S., & Page, T. (2012). Solving flexible job-shop scheduling problem using hybrid particle swarm optimisation algorithm and data mining. International Journal of Manufacturing Technology and Management, 26(1–4), 81–103.
Koonce, D., & Tsai, S. C. (2000). Using data mining to find patterns in genetic algorithm solutions to a job shop schedule. Computers & Industrial Engineering, 38(3), 361–374.
Korytkowski, P., Wiśniewski, T., & Rymaszewski, S. (2013). An evolutionary simulation-based optimization approach for dispatching scheduling. Simulation Modelling Practice and Theory, 35, 69–85.
Kuczapski, A. M., Micea, M. V., Maniu, L. A., & Cretu, V. I. (2010). Efficient generation of near optimal initial populations to enhance genetic algorithms for job-shop scheduling. Information Technology and Control, 39(1), 32–37.
Kundakcı, N., & Kulak, O. (2016). Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem. Computers & Industrial Engineering, 96, 31–51.
Kurdi, M. (2015). A new hybrid island model genetic algorithm for job shop scheduling problem. Computers & Industrial Engineering, 88, 273–283.
Li, X., & Gao, L. (2016). An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. International Journal of Production Economics, 174, 93–110.
Li, X., & Olafsson, S. (2005). Discovering dispatching rules using data mining. Journal of Scheduling, 8(6), 515–527.
Lu, H., Huang, G. Q., & Yang, H. (2011). Integrating order review/release and dispatching rules for assembly job shop scheduling using a simulation approach. International Journal of Production Research, 49(3), 647–669.
Metan, G., Sabuncuoglu, I., & Pierreval, H. (2010). Real time selection of scheduling rules and knowledge extraction via dynamically controlled data mining. International Journal of Production Research, 48(23), 6909–6938.
Natarajan, K., Mohanasundaram, K., Babu, B. S., Suresh, S., Raj, K. A. A. D., & Rajendran, C. (2007). Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardiness. The International Journal of Advanced Manufacturing Technology, 31(7–8), 751–761.
Nguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2013a). A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem. IEEE Transactions on Evolutionary Computation, 17(5), 621–639.
Nguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2013b). Learning iterative dispatching rules for job shop scheduling with genetic programming. The International Journal of Advanced Manufacturing Technology, 67(1–4), 85–100.
Ning, L., Abdelrahman, M., & Ramaswamy, S. (2005). A genetic algorithm for single machine total weighted tardiness scheduling problem. International Journal of Intelligent Control and Systems, 10(3), 218–225.
Olafsson, S., & Li, X. (2010). Learning effective new single machine dispatching rules from optimal scheduling data. International Journal of Production Economics, 128(1), 118–126.
Pierreval, H., & Mebarki, N. (1997). Dynamic scheduling selection of dispatching rules for manufacturing system. International Journal of Production Research, 35(6), 1575–1591.
Potts, C. N., & Van Wassenhove, L. N. (1985). A branch and bound algorithm for the total weighted tardiness problem. Operations Research, 33(2), 363–377.
Qiao, F., Li, L., Ma, Y., & Shi, B. (2012). Single machine oriented match-up rescheduling method for semiconductor manufacturing system. In International Conference on Intelligent Robotics and Applications (pp. 217–226). Berlin: Springer
Raghu, T., & Rajendran, C. (1993). An efficient dynamic dispatching rule for scheduling in a job shop. International Journal of Production Economics, 32(3), 301–313.
Ritwik, K., & Deb, S. (2011). A genetic algorithm-based approach for optimization of scheduling in job shop environment. Journal of Advanced Manufacturing Systems, 10(02), 223–240.
Said, N., Mouelhi, W., & Ghedira, K. (2015). Classification rules for the job shop scheduling problem with machine breakdowns. International Journal of Information and Electronics Engineering, 5(4), 300.
Shahzad, A., & Mebarki, N. (2012). Data mining based job dispatching using hybrid simulation-optimization approach for shop scheduling problem. Engineering Applications of Artificial Intelligence, 25(6), 1173–1181.
Shahzad, A., & Mebarki, N. (2016). Learning dispatching rules for scheduling: A synergistic view comprising decision trees, tabu search and simulation. Computers, 5(1), 3.
Sharma, P., & Jain, A. (2015). Performance analysis of dispatching rules in a stochastic dynamic job shop manufacturing system with sequence-dependent setup times: Simulation approach. CIRP Journal of Manufacturing Science and Technology, 10, 110–119.
Trentesaux, D., Pach, C., Bekrar, A., Sallez, Y., Berger, T., Bonte, T., et al. (2013). Benchmarking flexible job-shop scheduling and control systems. Control Engineering Practice, 21(9), 1204–1225.
Wang, J. F., Du, B. Q., Ding, H. M. (2011). A genetic algorithm for the flexible job-shop scheduling problem. In Advanced Research on Computer Science and Information Engineering, Berlin: Springer (pp. 332–339).
Wang, L., & Zheng, D. Z. (2001). An effective hybrid optimization strategy for job-shop scheduling problems. Computers & Operations Research, 28(6), 585–596.
Wilensky, U. (1999). Center for connected learning and computer-based modeling. Evanston, IL: NetLogo.
Yazdani, M., Aleti, A., Khalili, S. M., & Jolai, F. (2017). Optimizing the sum of maximum earliness and tardiness of the job shop scheduling problem. Computers & Industrial Engineering, 107, 12–24.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix A
In this appendix, the detailed results of the proposed genetic algorithm for all instances are reported. Each table contains the GA’s results of a specific problem category, for instance, in Table 10 are presented the GA’s results for \(15 \times 15\) problems. The tables’ columns contain the following information:
-
Pb.: is the id of the problem (in order of appearance in the benchmark),
-
GA’s \(C_\mathrm{{max}}\): the makespan of the best-found solution (DR set) using the GA,
-
Un. Sol.: is the number of unique found chromosomes (solutions) by the GA during the space search over \(q^m\) possible solutions,
-
Best-known \(C_\mathrm{{max}}\): the best-known lower bound and upper bound (if available) for each scheduling problem in the OR-Library,
-
\(C_\mathrm{{max}}\) Gap: is the average difference between the GA’s solution and the best-known lower and upper bounds (see Eqs. 3 and 4),
-
Bt. Sets.: is the number of the best dispatching rules sets found using the GA, i.e., the DR sets with the same best makespan, over the number of unique found solutions (Un. Sol.),
-
Dispatching rules set: is a list of integer values (one of the best-found DR sets) displaying the number of rules to use on each machine. The number of integers is equal to the number of machines (15 or 20 depending on the problem) (Tables 11, 12, 13, 14, 15, 16, and 17).
Appendix B
In this appendix, the decision tree results (learning 100) of the decision tree are presented. For instance, in Table 18 the decision tree is generated using the scheduling data of \(15 \times 15\) problems and the other 70 instances are solved using the DT. The tables contain the following information:
-
Pb. Category: the size (category) of the problem instances solved using the DT,
-
Av. DT’s \(C_{\max }\): the average \(C_{\max }\) obtained by the DT when solving the instances of the current problems category,
-
Av. GA’s \(C_{\max }\): the average \(C_{\max }\) obtained by the GA when solving the instances of the current problems category,
-
\(C_{\max }\) Gap: the average gap between the DT and the GA (see equation 6).
From Tables 18, 19, 20, 21, 22, 23, 24, and 25, it can be noted that the lowest makespan gap between the decision tree and the genetic algorithm is of 7.36% and is obtained using the \(30 \times 15\) job shop instances for learning and solving the \(100 \times 20\) problems, while the highest gap is equal to 22.66% involving the same learning dataset when solving the \(20 \times 15\) JSSP.
An interesting observation is that the more the jobs in a problem, the lesser the gap between the decision tree and the genetic algorithm. When solving the problems \(15 \times 15\), \(20 \times 15\), \(20 \times 20\), \(30 \times 15\), \(30 \times 20\), \(50 \times 15\), \(50 \times 20\), and \(100 \times 20\) using the different learning datasets, the average gap is of 19.50, 17.90, 15.37, 14.79, 12.97, 12.39, 10.85, and 8.20%, respectively. This is due to the number of jobs waiting on each machines’ queue. For example, with a small number of jobs on a machine’s queue, i.e., 2, 3, or 4 jobs, the selection of the best dispatching rules is not efficient because the voting procedure does not manage to identify the best rules (no popular DR). However, with more jobs on the queues, the vote becomes more useful resulting in better results (lower makespan).
Rights and permissions
About this article
Cite this article
Habib Zahmani, M., Atmani, B. Multiple dispatching rules allocation in real time using data mining, genetic algorithms, and simulation. J Sched 24, 175–196 (2021). https://doi.org/10.1007/s10951-020-00664-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-020-00664-5