Scheduling to Minimize the Sum of Weighted Total Flow Time and Makespan in a Permutation Flow Shop with Setup Time

Abstract

The Permutation Flow shop Scheduling Problem is a typical combinational optimization problem and has been proved to be strongly NP-hard. This paper deals with B-GRASP algorithm meta-heuristic in finding the solution and in analyzing the best the optimal schedule, thus minimizing the bi-objectives such as weighted makespan and total flow time. The proposed approach is evaluated using benchmark problems taken from Taillard and compared with simulated annealing algorithm. Computational experiments indicate that the proposed B-GRASP algorithm is a feasible and effective approach for the multiobjective problem.