Rule based heuristic approach for minimizing total flow time in permutation flow shop scheduling
暂无分享,去创建一个
Kannan Govindan | Balasundaram Rathinam | Baskar Neelakandan | Siva Sankar Raghavan | K. Govindan | Baskar Neelakandan | Balasundaram Rathinam | S. Raghavan
[1] J. Ross Quinlan,et al. Induction of Decision Trees , 1986, Machine Learning.
[2] Xiaonan Li,et al. Discovering Dispatching Rules Using Data Mining , 2005, J. Sched..
[3] Uday K. Chakraborty,et al. An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling , 2008 .
[4] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .
[5] SHI Ling,et al. Two-machine Flow-shop Scheduling Problems with Minimizing the Total Completion Times , 2012 .
[6] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[7] Dong-Ho Lee,et al. Real-time scheduling for reentrant hybrid flow shops: A decision tree based mechanism and its application to a TFT-LCD line , 2011, Expert Syst. Appl..
[8] D. Chaudhuri,et al. An efficient heuristic approach to the scheduling of jobs in a flowshop , 1992 .
[9] Nasser Mebarki,et al. Data mining based job dispatching using hybrid simulation-optimization approach for shop scheduling problem , 2012, Eng. Appl. Artif. Intell..
[10] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[11] Quan-Ke Pan,et al. Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization , 2013 .
[12] Jatinder N. D. Gupta,et al. A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .
[13] Xiao Xu,et al. An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization , 2011, Expert Syst. Appl..
[14] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .
[15] Andrew Kusiak,et al. Data mining: manufacturing and service applications , 2006 .
[16] Bertrand M. T. Lin,et al. Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence , 2012, Discret. Optim..
[17] Andrew Kusiak,et al. Data Mining in Manufacturing: A Review , 2006 .
[18] Sigurdur Olafsson,et al. Learning effective new single machine dispatching rules from optimal scheduling data , 2010 .
[19] R. Sudhakara Pandian,et al. FLOW SHOP SCHEDULING ALGORITHM TO MINIMIZE COMPLETION TIME FOR-JOBS-MACHINES , 2010 .
[20] Mircea ANCĂU,et al. ON SOLVING FLOWSHOP SCHEDULING PROBLEMS , 2012 .
[21] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[22] Jiyin Liu,et al. Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..
[23] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .