Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garey, M., Johnson, D., Sethi, R.: The complexity of flow shop and job shop scheduling. Maths Ops. Res. 1, 117–129 (1976)
Vancheeswaran, R., Townsend, M.A.: A two-stage heuristic procedure for scheduling job shops. Journal of Manufacturing Systems 12, 315–325 (1993)
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)
Zeestraten, M.J.: The look ahead dispatching procedure. International Journal of Production Research 28, 369–384 (1990)
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)
Taillard, E.D.: Parallel Taboo search techniques for the job shop scheduling problem. ORSA Journal of Computing 6, 108–117 (1994)
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)
Willems, T.M., Rooda, J.E.: Neural networks for job shop scheduling. Control Engineering Practice 2, 31–39 (1994)
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)
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)
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)
Enns, S.T.: Job shop flow time prediction and tardiness control using queuing analysis. International Journal of Production Research 31, 2045–2057 (1993)
Kusiak, A.: Data Mining: Manufacturing and service Applications. International Journal of Production Research 44, 4175–4191 (2006)
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)
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)
Quinlan, J.R.: Induction of Decision Trees. Machine Learning 1, 81–106 (1986)
Muth, J.F., Thomson, G.L.: Industrial scheduling. Prantice Hall, Englewood Cliffs (1963)
Saravanan, M., Noorul Haq, A.: A scatter search algorithm for scheduling optimization of job shop problems. Int. J. Product Development 10, 259–272 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balasundaram, R., Baskar, N., Siva Sankar, R. (2013). Discovering Dispathcing Rules for Job Shop Schdeuling Using Data Mining. In: Meghanathan, N., Nagamalai, D., Chaki, N. (eds) Advances in Computing and Information Technology. Advances in Intelligent Systems and Computing, vol 178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31600-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-31600-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31599-2
Online ISBN: 978-3-642-31600-5
eBook Packages: EngineeringEngineering (R0)