A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods

A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods

0.00 Avg rating0 Votes
Article ID: iaor2009233
Country: Netherlands
Volume: 54
Issue: 1
Start Page Number: 1
End Page Number: 11
Publication Date: Feb 2008
Journal: Computers & Industrial Engineering
Authors: , ,
Keywords: heuristics: tabu search
Abstract:

Flowshop scheduling deals with the sequencing of a set of jobs that visit a set of machines in the same order. A tabu search procedure is proposed for the flowshop scheduling problem with the makespan minimization criterion. Different from other tabu search procedures, the neighborhood of a solution is generated using a combination of three different exchange mechanisms. This has resulted in a well-diversified search procedure.

Reviews

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