2013•arXiv (Cornell University)Open access

Competitive-Ratio Approximation Schemes for Minimizing the Makespan in\n the Online-List Model

Nicole Megow, Andreas Wiese

Abstract

We consider online scheduling on multiple machines for jobs arriving\none-by-one with the objective of minimizing the makespan. For any number of\nidentical parallel or uniformly related machines, we provide a\ncompetitive-ratio approximation scheme that computes an online algorithm whose\ncompetitive ratio is arbitrarily close to the best possible competitive ratio.\nWe also determine this value up to any desired accuracy. This is the first\napplication of competitive-ratio approximation schemes in the online-list\nmodel. The result proves the applicability of the concept in different online\nmodels. We expect that it fosters further research on other online problems.\n

Open-access reader

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Competitive analysis, Online algorithm, Job shop scheduling, Scheduling (production processes), Computer science, Mathematical optimization, Approximation algorithm, Scheme (mathematics)