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
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems