Makespan minimization for scheduling unrelated parallel machines with setup times

作者：Ying Kuo Ching; Lee Zne Jung; Lin Shih Wei^*

来源：Journal of Intelligent Manufacturing, 2012, 23(5): 1795-1803.

DOI：10.1007/s10845-010-0483-3

• Scheduling
• Unrelated parallel machines
• Meta-heuristic
• Simulated annealing

This study considers the problem of scheduling jobs on unrelated parallel machines with machine-dependent and job sequence-dependent setup times. In this study, a restricted simulated annealing (RSA) algorithm which incorporates a restricted search strategy is presented to minimize the makespan. The proposed RSA algorithm can effective reduce the search effort required to find the best neighborhood solution by eliminating ineffective job moves. The effectiveness and efficiency of the proposed RSA algorithm is compared with the basic simulated annealing and existing meta-heuristics on a benchmark problem dataset used in earlier studies. Computational results indicate that the proposed RSA algorithm compares well with the state-of-the-art meta-heuristic for small-sized problems, and significantly outperforms basic simulated annealing algorithm and existing algorithms for large-sized problems.

• 出版日期2012-10
• 单位长春大学