@Article{,
title={Exerct and Near Optimal Solution for Three Machine Flow Shop Scheduling},
author={Tariq S. Abdul-Razaq and Manal H. AL-Harby},
journal={Journal of College of Education مجلة كلية التربية},
volume={},
number={3},
pages={50-63},
year={2006},
abstract={In this paper we consider F3/ /C.o* problem in which theprocessing order is assumed to be the same on each machine, theresulting problem is called the permutation flow shop problem. Theobjective is to find a processing order on each machine such thatthe makespan C*o* , which is the completion time of the last job isminimized. This problem is NP-hard, hence the existence of apolynomial time algorithm for finding an optimal solution isunlikely. This complexity result leads us to use an enumerationsolution approach. In this paper rve proposc a branch and boundal-eorithm to solve this problem. Also we develop fastapproximation algorithms yielding near optimal solution. We}
}