Supervised learning linear priority dispatch rules for job-shop scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6683 LNCS, Issue , 2011, Pages 263-277

  Ingimundardottir, Helga ^a   Runarsson, Thomas Philip ^a  

^a UNIVERSITY OF ICELAND   (Iceland)

Author keywords

[No Author keywords available]

Indexed keywords

DISPATCH RULES; DISPATCHING RULES; EXPERIMENTAL STUDIES; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP; JOB-SHOP SCHEDULING; LINEAR CLASSIFICATION; MINIMUM MAKESPAN; OPTIMAL SOLUTIONS; PRIORITY DISPATCHING RULES; PROBLEM INSTANCES; TIME STEP; TRAINING DATA;

DIGITAL STORAGE; HEURISTIC ALGORITHMS; OPTIMAL SYSTEMS; OPTIMIZATION; SCHEDULING ALGORITHMS;

SUPERVISED LEARNING;

EID: 84867870798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25566-3_20     Document Type: Conference Paper

References (12)

1. Zhang, W., Dietterich, T.G.: A Reinforcement Learning Approach to Job-shop Scheduling. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp. 1114-1120. Morgan Kaufmann, San Francisco (1995)
2. Tay, J., Ho, N.: Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computers & Industrial Engineering 54(3), 453-473 (2008)
3. Li, X., Olafsson, S.: Discovering Dispatching Rules Using Data Mining. Journal of Scheduling 8(6), 515-527 (2005)
4. Malik, A.M., Russell, T., Chase, M., Beek, P.: Learning heuristics for basic block instruction scheduling. Journal of Heuristics 14(6), 549-569 (2007)
5. Garey, M., Johnson, D., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1(2), 117-129 (1976)
6. Panwalkar, S., Iskander, W.: A Survey of Scheduling Rules. Operations Research 25(1), 45-61 (1977)
7. Russell, T., Malik, A.M., Chase, M., van Beek, P.: Learning Heuristics for the Superblock Instruction Scheduling Problem. IEEE Transactions on Knowledge and Data Engineering 21(10), 1489-1502 (2009)
8. Burke, E., Petrovic, S., Qu, R.: Case-based heuristic selection for timetabling problems. Journal of Scheduling 9(2), 115-132 (2006)
9. Jayamohan, M.: Development and analysis of cost-based dispatching rules for job shop scheduling. European Journal of Operational Research 157(2), 307-321 (2004)
10. Makhorin, A.: GNU linear programming kit. Moscow Aviation Institute, Moscow, Russia, 38 (May 2009), Software available at http://www.gnu.org/ software/glpk/glpk.html
11. Fan, R.e., Wang, X.r., Lin, C.j.: LIBLINEAR: A Library for Large Linear Classification. Corpus 9, 1871-1874 (2008), Software available at http://www.csie.ntu.edu.tw/~cjlin/liblinear
12. Lin, C.j., Weng, R.C.: Trust Region Newton Method for Large-Scale Logistic Regression. Journal of Machine Learning Research 9, 627-650 (2008)