Heuristic Methods for Problems with Blocking Constraints Solving Jobshop Scheduling


Jobshop problem is one of the most difficult classical scheduling problems. Very simple special cases of jobshop problem are strongly NP-hard. This paper deals with makespan minimization in jobshop scheduling problems with a specific blocking constraint met in several industrial problems. We also propose and define another new type of blocking constraint… (More)