AI Chat AI Image Generator AI Video Text to Speech

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

12/28/2019

∙

by Wenxin Li, et al.

∙

∙

In this paper, we prove that under mild stochastic assumptions, work-conserving disciplines are asymptotic optimal for minimizing total completion time.

Wenxin Li
18 publications
Ness Shroff
39 publications

page 1

page 2

page 3

page 4

research

∙ 12/28/2019

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

In this paper, we prove that under mild stochastic assumptions, work-con...

0 Wenxin Li, et al. ∙

research

∙ 02/21/2018

Asymptotic efficiency of restart and checkpointing

Many tasks are subject to failure before completion. Two of the most com...

0 Antonio Sodre, et al. ∙

research

∙ 06/26/2019

The impatient collector

In the coupon collector problem with n items, the collector needs a rand...

0 Anis Amri, et al. ∙

research

∙ 07/09/2022

Stochastic approximation with decision-dependent distributions: asymptotic normality and optimality

We analyze a stochastic approximation algorithm for decision-dependent p...

0 Joshua Cutler, et al. ∙

research

∙ 07/16/2021

On the complexity of open shop scheduling with time lags

The minimization of makespan in open shop with time lags has been shown ...

0 Wieslaw Kubiak, et al. ∙

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

0 Bin Fu, et al. ∙

research

∙ 07/29/2020

Maritime Design: A CSCW Territory?

This paper focuses on remote-control and autonomous vessels from a socio...

0 Yushan Pan, et al. ∙