Simulated annealing for permutation flow-shop scheduling

Simulated annealing for permutation flow-shop scheduling

0.00 Avg rating0 Votes
Article ID: iaor1989910
Country: United Kingdom
Volume: 17
Start Page Number: 551
End Page Number: 557
Publication Date: Dec 1989
Journal: OMEGA
Authors: ,
Keywords: heuristics, optimization: simulated annealing
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.