No-wait jobshop scheduling using simulated annealing

We propose in this paper a method to minimize the makespan of a set of jobs in a no-wait jobshop where transports are made by a hoist. Two heuristics are provided to transform the scheduling problem into a sequencing problem which is solved by a simulated annealing method. Heuristics are aimed to determine entry dates, that meet the no-wait constraints, for each sequence of jobs. This approach is tested and compared with Rajendran's heuristic in the case of no-wait flowshop and yields quite good results.