N. Buchbinder, T. Kimbrel, et al.
SODA 2008
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
A. Grigoriev, J. van Loon, et al.
Operations Research Letters
H. Kaplan, M. Lewenstein, et al.
FOCS 2003
T. Nowicki, M. Sviridenko, et al.
Fundamenta Mathematicae