Scheduling multiprocessor tasks in a two-stage flow-shop environment

In this paper, we developed several efficient heuristic algorithms to schedule unit processing time multiprocessor tasks in a two-stage hybrid flow-shop for minimizing makespan. We also derived two effective lower bounds for the problem. Then, we analyzed the average performance of the heuristic algorithms by computing the average relative gap of each heuristic solution from the lower bound. The results of the computational experiment to test the average performance of the proposed heuristic algorithms on a set of randomly generated problems showed that three of the proposed heuristic algorithms perform well.