A Study on Simulated Annealing Algorithm in Flowshop Scheduling

Flowshop 일정계획을 위한 Simulated Annealing 알고리듬 이용

A modified simulated annealing algorithm is proposed and applied to the permutation flowshop scheduling with the makespan objective. Based on the job deletion and insertion method, a newly defined Max-min perturbation scheme is proposed to obtain a better candidate solution in the simulated annealing process. The simulation experiments are conducted to evaluate the effectiveness of the proposed algorithm against the existing heuristics and results are reported.