In this paper we present two approximation algorithms for the permutation flow shop problem with makespan objective.
By: Maxim I. Sviridenko
Published in: Annals of Operations Research, volume 129, (no 1-4), pages 247-52 in 2004
Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.
Questions about this service can be mailed to reports@us.ibm.com .