Online combinatorial optimization with multiple projections and its application to scheduling problem

Takahiro Fujita; Kohei Hatano; Shuji Kijima; Eiji Takimoto

doi:10.1587/transfun.E101.A.1334

Online combinatorial optimization with multiple projections and its application to scheduling problem

Takahiro Fujita, Kohei Hatano, Shuji Kijima, Eiji Takimoto

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	1334-1343
Number of pages	10
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E101A
Issue number	9
DOIs	https://doi.org/10.1587/transfun.E101.A.1334
Publication status	Published - Sept 2018

All Science Journal Classification (ASJC) codes

Signal Processing
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1587/transfun.E101.A.1334

Cite this

@article{b2246cebecb343ca94a422349bc96edf,

title = "Online combinatorial optimization with multiple projections and its application to scheduling problem",

abstract = "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.",

author = "Takahiro Fujita and Kohei Hatano and Shuji Kijima and Eiji Takimoto",

note = "Publisher Copyright: {\textcopyright} 2018 The Institute of Electronics, Information and Communication Engineers.",

year = "2018",

month = sep,

doi = "10.1587/transfun.E101.A.1334",

language = "English",

volume = "E101A",

pages = "1334--1343",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "9",

}

TY - JOUR

T1 - Online combinatorial optimization with multiple projections and its application to scheduling problem

AU - Fujita, Takahiro

AU - Hatano, Kohei

AU - Kijima, Shuji

AU - Takimoto, Eiji

PY - 2018/9

Y1 - 2018/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85053853148&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85053853148&partnerID=8YFLogxK

U2 - 10.1587/transfun.E101.A.1334

DO - 10.1587/transfun.E101.A.1334

M3 - Article

AN - SCOPUS:85053853148

SN - 0916-8508

VL - E101A

SP - 1334

EP - 1343

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

IS - 9

ER -

Online combinatorial optimization with multiple projections and its application to scheduling problem

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this