M. Sviridenko
Algorithmica (New York)
Paper
Makespan minimization in no-wait flow shops: A polynomial time approximation scheme
Abstract
We investigate the approximability of a no-wait permutation flow shop scheduling problem under the makespan criterion. We present a polynomial time approximation scheme (PTAS) for the problem on any fixed number of machines.
Related
N. Buchbinder, T. Kimbrel, et al.
SODA 2008
Conference paper
Dynamic placement for clustered web applications
A. Karve, T. Kimbrel, et al.
WWW 2006
A. Grigoriev, J. van Loon, et al.
Operations Research Letters