A TIGHT LOWER-BOUND FOR THE COMPLETION-TIME VARIANCE PROBLEM

Authors
NG CT CAI X CHENG TCE
Citation
Ct. Ng et al., A TIGHT LOWER-BOUND FOR THE COMPLETION-TIME VARIANCE PROBLEM, European journal of operational research, 92(1), 1996, pp. 211-213
Citations number
11
Categorie Soggetti
Management,"Operatione Research & Management Science
Journal title
European journal of operational research → ACNP
ISSN journal
03772217
Volume
92
Issue
1
Year of publication
1996
Pages
211 - 213
Database
ISI
SICI code
0377-2217(1996)92:1<211:ATLFTC>2.0.ZU;2-O
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.