Abstract
Online makespan minimization is a classical problem in which a sequence of jobs σ = J1, ..., Jn has to be scheduled on m identical parallel machines so as to minimize the maximum completion time of any job. In this paper we investigate the problem in a model where extra power/resources are granted to an algorithm. More specifically, an online algorithm is allowed to build several schedules in parallel while processing σ. At the end of the scheduling process the best schedule is selected. This model can be viewed as providing an online algorithm with extra space, which is invested to maintain multiple solutions. As a main result we develop a (4/3 + ε)-competitive algorithm, for any 0
Cite
CITATION STYLE
Albers, S., & Hellwig, M. (2014). Online makespan minimization with parallel schedules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8503 LNCS, pp. 13–25). Springer Verlag. https://doi.org/10.1007/978-3-319-08404-6_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
