期刊
JOURNAL OF INTELLIGENT MANUFACTURING
卷 23, 期 5, 页码 1795-1803出版社
SPRINGER
DOI: 10.1007/s10845-010-0483-3
关键词
Scheduling; Unrelated parallel machines; Meta-heuristic; Simulated annealing
资金
- Chang Gung University [UARPD390081]
- National Science Council of the Republic of China, Taiwan [NSC99-2628-E-027-003, NSC99-2410-H-182-023-MY2]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据