Abstract
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 language | English |
---|---|
Pages (from-to) | 1126-1131 |
Number of pages | 6 |
Journal | International Journal of Advanced Manufacturing Technology |
Volume | 30 |
Issue number | 11-12 |
DOIs | |
Publication status | Published - 10-2006 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Software
- Mechanical Engineering
- Computer Science Applications
- Industrial and Manufacturing Engineering