Online linear optimization for job scheduling under precedence constraints

Takahiro Fujita, Kohei Hatano, Shuji Kijima, Eiji Takimoto

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

1 被引用数 (Scopus)

抄録

We consider an online job scheduling problem on a single machine with precedence constraints under uncertainty. In this problem, for each trial t = 1,..., T, the player chooses a total order (permutation) of n fixed jobs satisfying some prefixed precedence constraints. Then, the adversary determines the processing time for each job, 9 and the player incurs as loss the sum of the processing time and the waiting time. The goal of the player is to perform as well as the best fixed total order of jobs in hindsight. We formulate the problem as an online linear optimization problem over the permutahedron (the convex hull of permutation vectors) with specific linear constraints, in which the underlying decision space is written with exponentially many linear constraints. We propose a polynomial time online linear optimization algorithm; it predicts almost as well as the state-of-the-art offline approximation algorithms do in hindsight.

本文言語英語
ホスト出版物のタイトルAlgorithmic Learning Theory - 26th International Conference, ALT 2015
編集者Claudio Gentile, Sandra Zilles, Kamalika Chaudhuri
出版社Springer Verlag
ページ332-346
ページ数15
ISBN(印刷版)9783319244853
DOI
出版ステータス出版済み - 2015
イベント26th International Conference on Algorithmic Learning Theory, ALT 2015 - Banff, カナダ
継続期間: 10月 4 201510月 6 2015

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9355
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他26th International Conference on Algorithmic Learning Theory, ALT 2015
国/地域カナダ
CityBanff
Period10/4/1510/6/15

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Online linear optimization for job scheduling under precedence constraints」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル