Adaptive simulated annealing algorithm for flow-shop scheduling problem
Flow-shop调度问题的自适应模拟退火算法

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.