Discovering Dispathcing Rules for Job Shop Schdeuling Using Data Mining
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.
KeywordsData mining make span job shop scheduling
Unable to display preview. Download preview PDF.
- 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
- 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.Quinlan, J.R.: Induction of Decision Trees. Machine Learning 1, 81–106 (1986)Google Scholar
- 17.Muth, J.F., Thomson, G.L.: Industrial scheduling. Prantice Hall, Englewood Cliffs (1963)Google Scholar