On the Asymptotic Optimality of Work-Conserving Disciplines in Completion Time Minimization

12/28/2019
by   Wenxin Li, et al.
0

In this paper, we prove that under mild stochastic assumptions, work-conserving disciplines are asymptotic optimal for minimizing total completion time. As a byproduct of our analysis, we obtain tight upper bound on the competitive ratios of work-conserving disciplines on minimizing the metric of flow time.

READ FULL TEXT
research
12/28/2019

A Note on the Asymptotic Optimality of Work-Conserving Disciplines in Completion Time Minimization

In this paper, we prove that under mild stochastic assumptions, work-con...
research
10/25/2022

Tight analysis of lazy: an improved algorithm for open online dial-a-ride

In the open online dial-a-ride problem, a single server has to carry tra...
research
10/30/2017

An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint

In this paper we study the classical scheduling problem of minimizing th...
research
01/14/2019

Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line

The online Dial-a-Ride problem is a fundamental online problem in a metr...
research
04/05/2022

Streaming Approximation Scheme for Minimizing Total Completion Time on Parallel Machines Subject to Varying Processing Capacity

We study the problem of minimizing total completion time on parallel mac...
research
10/30/2018

Variability of research performance across disciplines within universities in non-competitive higher education systems

Many nations are adopting higher education strategies that emphasize the...
research
12/27/2022

Distribution-aware ℓ_1 Analysis Minimization

This work is about recovering an analysis-sparse vector, i.e. sparse vec...

Please sign up or login with your details

Forgot password? Click here to reset