Adaptive simulated annealing algorithm for flow-shop scheduling problem

Adaptive simulated annealing algorithm for flow-shop scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20043576
Country: China
Volume: 20
Issue: 3
Start Page Number: 445
End Page Number: 448
Publication Date: Jun 2003
Journal: Control Theory and Applications
Authors: , ,
Keywords: flowshop
Abstract:

An adaptive simulated annealing algorithm is proposed for the optimal or sub-optimal solution of flow-shop scheduling problem. A special neighborhood structure based on block property, simple computed method of object function and an adaptive annealing strategy are adopted in the algorithm. The experiment shows the effectiveness of this algorithm.

Reviews

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