Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem

Takahiro FUJITA  Kohei HATANO  Shuji KIJIMA  Eiji TAKIMOTO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E101-A   No.9   pp.1334-1343
Publication Date: 2018/09/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E101.A.1334
Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
online learning,  scheduling,  permutation,  combinatorial optimization,  

Full Text: PDF(790.5KB)>>
Buy this Article

We consider combinatorial online prediction problems and propose a new construction method of efficient algorithms for the problems. One of the previous approaches to the problem is to apply online prediction method, in which two external procedures the projection and the metarounding are assumed to be implemented. In this work, we generalize the projection to multiple projections. As an application of our framework, we show an algorithm for an online job scheduling problem with a single machine with precedence constraints.