Discovering dispatching rules from data using imitation learning: A case study for the job-shop problem

Helga Ingimundardottir () and Thomas Philip Runarsson ()
Additional contact information
Helga Ingimundardottir: University of Iceland, School of Engineering and Natural Sciences
Thomas Philip Runarsson: University of Iceland, School of Engineering and Natural Sciences

Journal of Scheduling, 2018, vol. 21, issue 4, No 2, 413-428

Abstract: Abstract Dispatching rules can be automatically generated from scheduling data. This paper will demonstrate that the key to learning an effective dispatching rule is through the careful construction of the training data, $$\{\mathbf {x}_i(k),y_i(k)\}_{k=1}^K\in {\mathscr {D}}$$ { x i ( k ) , y i ( k ) } k = 1 K ∈ D , where (i) features of partially constructed schedules $$\mathbf {x}_i$$ x i should necessarily reflect the induced data distribution $${\mathscr {D}}$$ D for when the rule is applied. This is achieved by updating the learned model in an active imitation learning fashion; (ii) $$y_i$$ y i is labelled optimally using a MIP solver; and (iii) data need to be balanced, as the set is unbalanced with respect to the dispatching step k. Using the guidelines set by our framework the design of custom dispatching rules, for a particular scheduling application, will become more effective. In the study presented three different distributions of the job-shop will be considered. The machine learning approach considered is based on preference learning, i.e. which dispatch (post-decision state) is preferable to another.

Keywords: Scheduling; Composite dispatching rules; Performance analysis; Imitation learning; DAgger; Preference learning (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-017-0534-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:21:y:2018:i:4:d:10.1007_s10951-017-0534-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-017-0534-0

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().