Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms
Year of publication: |
1997
|
---|---|
Authors: | Hall, Leslie A. ; Schulz, Andreas S. ; Shmoys, David B. ; Wein, Joel |
Published in: |
Mathematics of operations research. - Linthicum, Md : Inst, ISSN 0364-765X, ZDB-ID 1956838. - Vol. 22.1997, 3, p. 513-544
|
Saved in:
Saved in favorites
Similar items by person
-
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
Savelsbergh, Martin W.P., (2005)
-
A Polynomial Approximation Scheme for a Constrained Flow-shop Scheduling Problem
Hall, Leslie A., (1994)
-
Capacitated trees, capacitated routing, and associated polyhedra
Araque G., Jesús R., (1990)
- More ...