Discovering dispatching rules from data using imitation learning: A case study for the job-shop problem
- 13 June 2017
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 21 (4) , 413-428
Abstract
No abstract availableKeywords
Funding Information
- Háskóli Íslands (HI13110165)
This publication has 26 references indexed in Scilit:
- Advanced dispatching rules for large-scale manufacturing systemsThe International Journal of Advanced Manufacturing Technology, 2013
- A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case studyJournal of Intelligent Manufacturing, 2011
- Learning effective new single machine dispatching rules from optimal scheduling dataInternational Journal of Production Economics, 2010
- Learning heuristics for basic block instruction schedulingJournal of Heuristics, 2007
- Case-based heuristic selection for timetabling problemsJournal of Scheduling, 2006
- Discovering Dispatching Rules Using Data MiningJournal of Scheduling, 2005
- Development and analysis of cost-based dispatching rules for job shop schedulingEuropean Journal of Operational Research, 2004
- Algorithm portfoliosArtificial Intelligence, 2001
- A survey of priority rule-based schedulingOR Spectrum, 1989
- The Algorithm Selection Problem1976