Academic Journals Database
Disseminating quality controlled scientific knowledge

Simulated Annealing Algorithm to Minimize Makespanin Single Machine Scheduling Problem withUniform Parallel Machines

ADD TO MY LIST
 
Author(s): Panneerselvam Senthilkumar | Sockalingam Narayanan

Journal: Intelligent Information Management
ISSN 2160-5912

Volume: 03;
Issue: 01;
Start page: 22;
Date: 2011;
Original page

Keywords: Uniform Parallel Machines | Measure of Performance | Heuristic | Simulated Annealing Algorithm | ANOVA

ABSTRACT
This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. Since, this scheduling problem is a combinatorial problem; usage of a heuristic is inevitable to obtain the solution in polynomial time. In this paper, simulated annealing algorithm is presented. In the first phase, a seed generation algorithm is given. Then, it is followed by three variations of the simulated annealing algorithms and their comparison using ANOVA in terms of their solutions on makespan.
Why do you need a reservation system?      Affiliate Program