A Simulated Annealing Algorithm for Unrelated Parallel-Machine Scheduling Problem with Constrained resources

• Main Authors: Si-Nong Wu, 吳思農
• Other Authors: Chi-yang Tsai
• Format: Others
• Language: zh-TW
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/49130906095934780936

碩士 === 元智大學 === 工業工程與管理學系 === 93 === The study on unrelated parallel-machine scheduling problems has been assuming unconstrained resources. However, the resources in scheduling problems are usually limited in practice. It is well known that most of the unrelated parallel-machine scheduling problems alone are NP-hard. Therefore, utilizing its ability to escape local optimal points, the study applies simulated annealing method and attempts to develop an algorithm for unrelated parallel-machine scheduling problems. The objective considered in this study is to minimize the machines completing time. In order to evaluate the performance of the proposed algorithm, numerical experiments are conducted and the algorithm is tested on three numerical examples of different sizes, as well as, practical cases. The results show that it performs well compared to simple dispatching rules.