Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/9763
Title: Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
Authors: Ng, CT 
Cai, X
Cheng, TCE 
Issue Date: 1999
Publisher: John Wiley & Sons
Source: Naval research logistics, 1999, v. 46, no. 4, p. 373-398 How to cite?
Journal: Naval research logistics 
Abstract: A sequence is proposed as a solution to the well-known NP-hard problem. The proposed sequence can be constructed in O(n log n) time. The asymptotical optimality of the sequence is established within the framework of probabilistic analysis.
URI: http://hdl.handle.net/10397/9763
ISSN: 0894-069X
EISSN: 1520-6750
DOI: 10.1002/(SICI)1520-6750(199906)46:4<373
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

5
Last Week
0
Last month
Citations as of Sep 11, 2017

Page view(s)

59
Last Week
1
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.