Academic Journals Database
Disseminating quality controlled scientific knowledge

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

ADD TO MY LIST
 
Author(s): Panneerselvam Sivasankaran | Thambu Sornakumar | Ramasamy Panneerselvam

Journal: Intelligent Information Management
ISSN 2160-5912

Volume: 02;
Issue: 07;
Start page: 406;
Date: 2010;
Original page

Keywords: Makespan | Simulated Annealing Algorithm | GRASP | Unrelated Parallel Machines | Mathematical Model

ABSTRACT
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.
Why do you need a reservation system?      Save time & money - Smart Internet Solutions