Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines

作     者：Panneerselvam Sivasankaran Thambu Sornakumar Ramasamy Panneerselvam 

作者机构：不详 

出 版 物：《Intelligent Information Management》 (智能信息管理（英文）)

年 卷 期：2010年第2卷第7期

页      码：406-416页

摘      要：This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for such problem is highly inevitable. In this paper, two different Meta-heuristics to minimize the makespan of the assumed problem are designed and they are compared in terms of their solutions. In the first phase, the simulated annealing algorithm is presented and then GRASP (Greedy Randomized Adaptive Search procedure) is presented to minimize the makespan in the single machine scheduling problem with unrelated parallel machines. It is found that the simulated annealing algorithm performs better than GRASP.

主 题 词：Makespan Simulated Annealing Algorithm GRASP Unrelated Parallel Machines Mathematical Model 

学科分类：0711[理学-心理学类] 07[理学] 08[工学] 081101[081101] 0811[工学-水利类] 071102[071102] 081103[081103] 

D　O　I：10.4236/iim.2010.27050

馆 藏 号：203221639...