View article

The problem of scheduling jobs in a flow-shop is considered. The job processing order must be the same on each machine and the objective is to minimize the maximum completion time. Simulated annealing is proposed as a heuristic to obtain approximate solutions. Extensive computational tests with problems having up to 20 machines and 100 jobs show simulated annealing to compare favourably with known constructive heuristics and with descent methods.