Implementation of grasp in flow shop scheduling

In this paper the problem of permutation flow shop scheduling is considered with the objective of minimizing the makespan. An attempt is made to schedule the jobs using a new approach called greedy randomized adaptive search procedure (GRASP). It is a competitive algorithm and is a metaheuristic for...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced manufacturing technology 2006-10, Vol.30 (11-12), p.1126-1131
Main Authors: Prabhaharan, G., Khan, B. Shahul Hamid, Rakesh, L.
Format: Article
Language:English
Subjects:
Adaptive search techniques
Algorithms
Combinatorial analysis
Heuristic methods
Job shop scheduling
Job shops
Optimization
Permutations
Production scheduling
Schedules
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper the problem of permutation flow shop scheduling is considered with the objective of minimizing the makespan. An attempt is made to schedule the jobs using a new approach called greedy randomized adaptive search procedure (GRASP). It is a competitive algorithm and is a metaheuristic for combinatorial optimization. The performance of GRASP is then compared with that of NEH heuristics. The comparison is carried out with the benchmark problems taken from Carlier (1978), Reeves (1995) and Taillard (1993).
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-005-0134-6