Meta-heuristics that attempt to obtain (near) global optimal solutions of NP-hard combinatorial optimization problems generally require diversification to escape from local optimality. One way to achieve diversification is to utilize the multi-start hill climbing strategy. By combining the respective advantages of the multi-start hill climbing strategy and simulated annealing (SA), an effective multi-start simulated annealing (MSA) heuristic is proposed to minimize the makespan for a flowline manufacturing cell scheduling problem with sequence dependent family setup times. The heuristic performance is evaluated by comparing the results achieved by the proposed heuristic with those achieved by the existing meta-heuristics. The computational results show that following multi-start refinement the proposed MSA heuristic is more effective compared to the state-of the-art meta-heuristics on the same benchmark instances.
- Flowline manufacturing cell
- Multi-start simulated annealing
- Sequence dependent family setups