Implementation of grasp in flow shop scheduling

G. Prabhaharan, B. Shahul Hamid Khan, L. Rakesh

Research output: Contribution to journalArticlepeer-review

24 Citations (Scopus)


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).

Original languageEnglish
Pages (from-to)1126-1131
Number of pages6
JournalInternational Journal of Advanced Manufacturing Technology
Issue number11-12
Publication statusPublished - 10-2006

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Software
  • Mechanical Engineering
  • Computer Science Applications
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Implementation of grasp in flow shop scheduling'. Together they form a unique fingerprint.

Cite this