New heuristics to minimize makespan for two identical parallel machines with one constraint of unavailability on each machine

Abstract

This work is an extension of previous works [1], [2], [3] about scheduling jobs on identical parallel machines with constraints of unavailabilities to minimize the makespan. We are interested in this paper on the case with two identical parallel machines such that each machine is unavailable for one unavailability period such that the preemption of jobs is not allowed. We are divided this problem on five cases and for each of them we are proposed a heuristic to minimize the makespan. The obtained results, compared with those of Chien and Liao [13], show that our heuristics quit efficient in solving large problems.