Probabilistic Analysis of an Asymptotically Optimal Solution for the Completion Time Variance Problem
Year of publication: |
1999
|
---|---|
Authors: | Ng, C.T. ; Cai, X. ; Cheng, T.C.E. |
Published in: |
Naval research logistics : an international journal. - New York, NY : Wiley, ISSN 0894-069X, ZDB-ID 3924944. - Vol. 46.1999, 4, p. 373-398
|
Saved in:
Saved in favorites
Similar items by person
-
A tight lower bound for the completion time variance problem
Ng, C.T., (1996)
-
Minimizing Completion Time Variance with Compressible Processing Times
Ng, C.T., (2005)
-
Single-machine scheduling with a time-dependent learning effect
Wang, J.-B., (2008)
- More ...