Online Linear Optimization for Job Scheduling Under Precedence Constraints

IR (HANDLE) Open Access

Description

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.

Journal

Details 詳細情報について

  • CRID
    1050298532705544064
  • NII Article ID
    120006654679
  • HANDLE
    2324/1786655
  • Text Lang
    en
  • Article Type
    conference paper
  • Data Source
    • IRDB
    • CiNii Articles

Report a problem

Back to top