Said Toumi

Learn More
This paper addresses to the scheduling of a permutation flowshop scheduling problem with blocking constraints to minimize the total completion time with a branch and bound algorithm. New machine based lower bound was developed for the problem. The experimental results on this criterion have shown the efficiency of the proposed algorithm both in terms of(More)
The paper presents an exact approach for a permutation flowshop scheduling problem with blocking constraint. The objective is to minimize the total completion time of jobs. The solution method is a branch and bound procedure where lower bounds based on problem characteristics are derived. Whithin an experimental performance analysis, this approach is(More)
This paper addresses to the scheduling of a permutation flowshop scheduling problem with blocking constraints to minimize the total tardiness with a branch and bound algorithm. New machine based lower bound was developed for the problem. The experimental results have shown the efficiency of the proposed algorithm both in terms of solutions quality and time(More)
We consider the m machine blocking flowshop scheduling problem. The objective is to obtain a feasible solution that minimizes the total tardiness criterion. We derive new machine based lower bound for this problem. Favorable experimental results are reported on an extensive set of problem instances.
  • 1