Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times

02/13/2021
by   Marcin Bienkowski, et al.
0

We present a unified framework for minimizing average completion time for many seemingly disparate online scheduling problems, such as the traveling repairperson problems (TRP), dial-a-ride problems (DARP), and scheduling on unrelated machines. We construct a simple algorithm that handles all these scheduling problems, by computing and later executing auxiliary schedules, each optimizing a certain function on already seen prefix of the input. The optimized function resembles a prize-collecting variant of the original scheduling problem. By a careful analysis of the interplay between these auxiliary schedules, and later employing the resulting inequalities in a factor-revealing linear program, we obtain improved bounds on the competitive ratio for all these scheduling problems. In particular, our techniques yield a 4-competitive deterministic algorithm for all previously studied variants of online TRP and DARP, and a 3-competitive one for the scheduling on unrelated machines (also with precedence constraints). This improves over currently best ratios for these problems that are 5.14 and 4, respectively. We also show how to use randomization to further reduce the competitive ratios to 1+2/ln 3 < 2.821 and 1+1/ln 2 < 2.443, respectively. The randomized bounds also substantially improve the current state of the art. Our upper bound for DARP contradicts the lower bound of 3 given by Fink et al. (Inf. Process. Lett. 2009); we pinpoint a flaw in their proof.

READ FULL TEXT

page 1

page 5

page 13

page 15

page 16

page 21

research
05/02/2023

Randomized algorithms for fully online multiprocessor scheduling with testing

We contribute the first randomized algorithm that is an integration of a...
research
08/14/2022

An Improved Greedy Algorithm for Stochastic Online Scheduling on Unrelated Machines

Most practical scheduling applications involve some uncertainty about th...
research
09/28/2020

Explorable Uncertainty in Scheduling with Non-Uniform Testing Times

The problem of scheduling with testing in the framework of explorable un...
research
05/20/2020

A New Lower Bound for Deterministic Truthful Scheduling

We study the problem of truthfully scheduling m tasks to n selfish unrel...
research
11/03/2022

Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling

We study kill-and-restart and preemptive strategies for the fundamental ...
research
12/28/2019

New Competitive Analysis Results of Online List Scheduling Algorithm

Online algorithm has been an emerging area of interest for researchers i...
research
10/14/2022

Parallel solutions for ordinal scheduling with a small number of machines

We study ordinal makespan scheduling on small numbers of identical machi...

Please sign up or login with your details

Forgot password? Click here to reset