Chai Wah Wu
Linear Algebra and Its Applications
We consider offline algorithms for minimizing the total flow time on O(1) machines where jobs can be preempted arbitrarily but migrations are disallowed. Our main result is a quasi-polynomial time approximation scheme for minimizing the total flow time. We also consider more general settings and give some hardness results. © 2004 Elsevier B.V. All rights reserved.
Chai Wah Wu
Linear Algebra and Its Applications
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997