H. Kaplan, M. Lewenstein, et al.
FOCS 2003
In this paper we present two approximation algorithms for the permutation flow shop problem with makespan objective. The first algorithm has an absolute performance guarantee, the second one is an O(√m log m)-approximation algorithm. The last result is almost best possible approximation algorithm which can be obtained using the trivial lower bound (maximum of the maximum machine load and the maximum job length) (Potts, Shmoys, and Williamson, 1991).
H. Kaplan, M. Lewenstein, et al.
FOCS 2003
A. Karve, T. Kimbrel, et al.
WWW 2006
N. Buchbinder, T. Kimbrel, et al.
SODA 2008
M. Sviridenko
Algorithmica (New York)