A tight lower bound for the completion time variance problem

Chi To Ng; X. Cai; Edwin Tai Chiu Cheng

doi:10.1016/0377-2217(95)00165-4

A tight lower bound for the completion time variance problem

Research output: Journal article publication › Journal article › Academic research › peer-review

Abstract

We consider the completion time variance problem. Our main result is a tight lower bound for the mean completion time of an optimal sequence. This result can be applied to reduce the time required to solve the problem.

Original language	English
Pages (from-to)	211-213
Number of pages	3
Journal	European Journal of Operational Research
Volume	92
Issue number	1
DOIs	https://doi.org/10.1016/0377-2217(95)00165-4
Publication status	Published - 5 Jul 1996

ASJC Scopus subject areas

Modelling and Simulation
Management Science and Operations Research
Information Systems and Management

More information

10.1016/0377-2217(95)00165-4

Cite this

@article{6cfbe50d78e5427b91b12524fc2ab7d3,

title = "A tight lower bound for the completion time variance problem",

abstract = "We consider the completion time variance problem. Our main result is a tight lower bound for the mean completion time of an optimal sequence. This result can be applied to reduce the time required to solve the problem.",

author = "Ng, \{Chi To\} and X. Cai and Cheng, \{Edwin Tai Chiu\}",

year = "1996",

month = jul,

day = "5",

doi = "10.1016/0377-2217(95)00165-4",

language = "English",

volume = "92",

pages = "211--213",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - A tight lower bound for the completion time variance problem

AU - Ng, Chi To

AU - Cai, X.

AU - Cheng, Edwin Tai Chiu

PY - 1996/7/5

Y1 - 1996/7/5

N2 - We consider the completion time variance problem. Our main result is a tight lower bound for the mean completion time of an optimal sequence. This result can be applied to reduce the time required to solve the problem.

AB - We consider the completion time variance problem. Our main result is a tight lower bound for the mean completion time of an optimal sequence. This result can be applied to reduce the time required to solve the problem.

UR - https://www.scopus.com/pages/publications/0030570361

U2 - 10.1016/0377-2217(95)00165-4

DO - 10.1016/0377-2217(95)00165-4

M3 - Journal article

SN - 0377-2217

VL - 92

SP - 211

EP - 213

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

A tight lower bound for the completion time variance problem

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this