Bandit-based Monte-Carlo planning for the single-machine total weighted tardiness scheduling problem

Gabriel Kronberger, Roland Braune

Publikation: Beitrag in Buch/Bericht/TagungsbandKonferenzbeitragBegutachtung

1 Zitat (Scopus)

Abstract

The balance of exploration and exploitation is the essence of any successful meta-heuristic. The Multi-armed Bandit Problem represents a simple form of this general dilemma. This paper describes two heuristic optimization methods that use a simple yet efficient allocation strategy for the bandit problem called UCB1 to control the optimization process. The algorithms are applied to the well known Single Machine Total Weighted Tardiness Problem and the results compared to the results of other successful meta-heuristics for this scheduling problem.

OriginalspracheEnglisch
TitelComputer Aided Systems Theory - EUROCAST 2007 - 11th International Conference on Computer Aided Systems Theory, Revised Selected Papers
Herausgeber (Verlag)Springer
Seiten837-844
Seitenumfang8
ISBN (Print)9783540758662
DOIs
PublikationsstatusVeröffentlicht - 2007
Veranstaltung11th International Conference on Computer Aided Systems Theory, EUROCAST 2007 - Las Palmas de Gran Canaria, Spanien
Dauer: 12 Feb. 200716 Feb. 2007

Publikationsreihe

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band4739 LNCS
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Konferenz

Konferenz11th International Conference on Computer Aided Systems Theory, EUROCAST 2007
Land/GebietSpanien
OrtLas Palmas de Gran Canaria
Zeitraum12.02.200716.02.2007

Fingerprint

Untersuchen Sie die Forschungsthemen von „Bandit-based Monte-Carlo planning for the single-machine total weighted tardiness scheduling problem“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren