Discovering Dispathcing Rules for Job Shop Schdeuling Using Data Mining

  • R. Balasundaram
  • N. Baskar
  • R. Siva Sankar
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 178)


This paper introduces a methodology for generating scheduling rules using data mining approach to discover the dispatching sequence by applying learning algorithm directly to job shop scheduling. Job-shop scheduling is one of the well-known hardest combinatorial optimization problems. This paper considers the problem of finding schedule for a job shop to minimize the makespan using Decision Tree algorithm. This approach involves preprocessing of scheduling data into an appropriate data file, discovering the key scheduling concepts and representing of the data mining results in way that enables its use for job scheduling. In decision tree based approach, the attribute selection greatly influences the predictive accuracy and hence this approach also considers creation of additional attributes. The proposed approach is compared with literature and work is complement to the traditional methods.


Data mining make span job shop scheduling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Garey, M., Johnson, D., Sethi, R.: The complexity of flow shop and job shop scheduling. Maths Ops. Res. 1, 117–129 (1976)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Vancheeswaran, R., Townsend, M.A.: A two-stage heuristic procedure for scheduling job shops. Journal of Manufacturing Systems 12, 315–325 (1993)CrossRefGoogle Scholar
  3. 3.
    Itoh, K., Huang, D., Enkawa, T.: Two fold look-ahead search for multi-criterion job shop scheduling. International Journal of Production Research 31, 2215–2234 (1993)CrossRefGoogle Scholar
  4. 4.
    Zeestraten, M.J.: The look ahead dispatching procedure. International Journal of Production Research 28, 369–384 (1990)CrossRefGoogle Scholar
  5. 5.
    Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job shop scheduling problems using genetic algorithms, part –I: representation. International Journal of Computers and Industrial Engineering 30, 983–997 (1996)CrossRefGoogle Scholar
  6. 6.
    Taillard, E.D.: Parallel Taboo search techniques for the job shop scheduling problem. ORSA Journal of Computing 6, 108–117 (1994)MATHCrossRefGoogle Scholar
  7. 7.
    Omar, M., Baharum, A., Hasan, Y.A.: A job shop scheduling (JSSP) using genetic algorithm. In: Proceedings of 2nd IMT-GT Regional Conference on Mathematics, Statistics and Applications, June 13-15, University sains Malaysia, Penag (2006)Google Scholar
  8. 8.
    Willems, T.M., Rooda, J.E.: Neural networks for job shop scheduling. Control Engineering Practice 2, 31–39 (1994)CrossRefGoogle Scholar
  9. 9.
    Koonce, D.A., Tsai, S.C.: Using data mining to find patterns in genetic algorithm solution to a job shop schedule. Computers and Industrial Engineering 38, 361–374 (2000)CrossRefGoogle Scholar
  10. 10.
    Subramaniam, V., Ramesh, T., Lee, G.K., Wong, Y.S., Hong, G.S.: Job Shop Scheduling with Dynamic Fuzzy Selection of Dispatching Rules. International Journal of Advanced Manufacturing Technology 16, 759–764 (2000)CrossRefGoogle Scholar
  11. 11.
    Leon, V.J., Wu, S.D., Storer, R.H.: A game-theoretic control approach of Job shops in the presence of disruptions. International Journal of Production Research 32, 1451–1476 (1994)MATHCrossRefGoogle Scholar
  12. 12.
    Enns, S.T.: Job shop flow time prediction and tardiness control using queuing analysis. International Journal of Production Research 31, 2045–2057 (1993)CrossRefGoogle Scholar
  13. 13.
    Kusiak, A.: Data Mining: Manufacturing and service Applications. International Journal of Production Research 44, 4175–4191 (2006)MATHCrossRefGoogle Scholar
  14. 14.
    Harding, J.A., Shahbaz, M., Srinivas, Kusiak, A.: Data mining in Manufacturing: A review. Journal of Manufacturing Science and Engineering, ASME 128, 969–976 (2006)CrossRefGoogle Scholar
  15. 15.
    Shahzad, A., Mebarki, N.: Discovering Dispatching Rules For Job Shop Scheduling Problem Through Data Mining. In: 8th International Conference of Modeling and Simulation - MOSIM 2010, Hammamet – Tunisia, May 10-12 (2010)Google Scholar
  16. 16.
    Quinlan, J.R.: Induction of Decision Trees. Machine Learning 1, 81–106 (1986)Google Scholar
  17. 17.
    Muth, J.F., Thomson, G.L.: Industrial scheduling. Prantice Hall, Englewood Cliffs (1963)Google Scholar
  18. 18.
    Saravanan, M., Noorul Haq, A.: A scatter search algorithm for scheduling optimization of job shop problems. Int. J. Product Development 10, 259–272 (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Department of Mechanical EngineeringShri Angalamman College of Engineering and TechnologyTiruchirappalliIndia
  2. 2.Department of Mechanical EngineeringM.A.M. College of EngineeringTiruchirappalliIndia
  3. 3.Engineering Design CenterCaterpillar Inc.ChennaiIndia

Personalised recommendations