Algorithms of Minimizing Makespan and Range of Lateness of Flow Shop Machines

Abstract

In this paper, the three-machine variant flow shop scheduling problem is addressed with the bi-objectives of reducing the makespan (Cmax) and range of lateness (RL). The goal is to concatenating minimize the two objective functions, i.e., to minimize the range of lateness provided that the makespan is optimum. To discover the best solution to the issue for job sequences with up to 2000 jobs, we introduce the Branch and Bound algorithm, and use the genetic and the memetic algorithms to find pareto optimal solutions, and then the results will be compared between them.