Citation
Bandit Algorithms using Monte Carlo Rollouts for Job Shop Scheduling. In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium, pages 318-330, 2013.
Paper
Abstract
Various bandit algorithms for approximating solutions to the job-shop scheduling problem are presented. The methods use a one step look-ahead procedure to evaluate all jobs available for dispatching, by generating multiple feasible schedules via Monte Carlo rollouts. Jobs are then dispatched based on statistics collected from these rollouts. These di?erent bandit algorithms di?er in the way jobs are dispatched based on the statistics collected. Rollout algorithms designed for combinatorial optimization apply sequentially consistent heuristics, the algorithms presented here use inconsistent heuristics. The methods are tested on 600 job-shop problems of three di?erent dimensions
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2013-318-330-P, author = {E. Geirsson and T.P. Runarsson },
title = {Bandit Algorithms using Monte Carlo Rollouts for Job Shop Scheduling},
booktitle = {In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium},
year = {2013},
editor = {G. Kendall and B. McCollum and G. {Venden Berghe}},
pages = {318--330},
note = {Paper},
abstract = {Various bandit algorithms for approximating solutions to the job-shop scheduling problem are presented. The methods use a one step look-ahead procedure to evaluate all jobs available for dispatching, by generating multiple feasible schedules via Monte Carlo rollouts. Jobs are then dispatched based on statistics collected from these rollouts. These di?erent bandit algorithms di?er in the way jobs are dispatched based on the statistics collected. Rollout algorithms designed for combinatorial optimization apply sequentially consistent heuristics, the algorithms presented here use inconsistent heuristics. The methods are tested on 600 job-shop problems of three di?erent dimensions},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2013-318-330-P.pdf} }