Sankar Basu
Journal of the Franklin Institute
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.
Sankar Basu
Journal of the Franklin Institute
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009