Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
In this note, we give a 1.47-approximation algorithm for the preemptive scheduling of jobs with release dates on a single machine so as to minimize the weighted sum of job completion times; this problem is denoted by 1|rj, pmtn|∑jwjCj in the notation of Lawler et al. Our result improves on a 2-approximation algorithm due to Hall et al. Math. Oper. Res. 22 (1997) 513-544, and also yields an improved bound on the quality of a well-known linear programming relaxation of the problem.
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997