Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

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

doi:10.1002/(SICI)1520-6750(199906)46:4&lt;373::AID-NAV3&gt;3.0.CO;2-W

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

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

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

5 Citations (Scopus)

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.

Original language	English
Pages (from-to)	373-398
Number of pages	26
Journal	Naval Research Logistics
Volume	46
Issue number	4
DOIs	https://doi.org/10.1002/(SICI)1520-6750(199906)46:4<373::AID-NAV3>3.0.CO;2-W
Publication status	Published - 1 Jun 1999

ASJC Scopus subject areas

Modelling and Simulation
Ocean Engineering
Management Science and Operations Research

More information

10.1002/(SICI)1520-6750(199906)46:4<373::AID-NAV3>3.0.CO;2-W

Cite this

@article{23f9cf09e6f64ab2b5ee7ff5e401339f,

title = "Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem",

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

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

year = "1999",

month = jun,

day = "1",

doi = "10.1002/(SICI)1520-6750(199906)46:4<373::AID-NAV3>3.0.CO;2-W",

language = "English",

volume = "46",

pages = "373--398",

journal = "Naval Research Logistics Quarterly",

issn = "0894-069X",

publisher = "John Wiley and Sons Inc.",

number = "4",

}

TY - JOUR

T1 - Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

AU - Ng, Chi To

AU - Cai, X.

AU - Cheng, Edwin Tai Chiu

PY - 1999/6/1

Y1 - 1999/6/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0033148917&partnerID=8YFLogxK

U2 - 10.1002/(SICI)1520-6750(199906)46:4<373::AID-NAV3>3.0.CO;2-W

DO - 10.1002/(SICI)1520-6750(199906)46:4<373::AID-NAV3>3.0.CO;2-W

M3 - Journal article

SN - 0894-069X

VL - 46

SP - 373

EP - 398

JO - Naval Research Logistics Quarterly

JF - Naval Research Logistics Quarterly

IS - 4

ER -

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this