Conference paper
Surface light-induced changes in thin polymer films
Andrew Skumanich
SPIE Optics Quebec 1993
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.
Andrew Skumanich
SPIE Optics Quebec 1993
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ