Implementation of grasp in flow shop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 30, Issue 11-12, 2006, Pages 1126-1131

  Prabhaharan, G ^a   Khan, B Shahul Hamid ^a   Rakesh, L ^a  

^a NATIONAL INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Flow shop; GRASP; Makespan; Metaheuristic

Indexed keywords

FLOW SHOP; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP); METAHEURISTIC;

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 33749996493     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-005-0134-6     Document Type: Article

References (19)

1. Johnson S M (1954) Optimal two and three stage production schedules. Noval Res Logist Q 1:61-68
2. Ignall E, Schrge L (1965) Application of branch and bound technique to some flow shop scheduling problems. Oper Res 13:400-412
3. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n-job, m-machine sequencing problem. Manage Sci 16:B630-B637
4. Nawaz M, Enscore EH (1983) A heuristic algorithm for the m machine, n job flow shop sequencing problem. OMEGA11, pp 91-95
5. Ischibuchi H, Tanaka SH (1995) Modified simulated annealing algorithm for the flow shop sequencing problems. Eur J Oper Res 81:388-398
6. Carlier J (1978) Benchmark problems for flow shop scheduling. Oper Res 12:333-351
7. Reeves CR (1995) A genetic algorithm for flow shop scheduling. Oper Res 22:5-13
8. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278-285
9. Holthaus O, Rajendran C (1997) Efficient dispatching rules for scheduling in a job shop. Int J Prod Econ 48:87-105
10. Rajendran C, Chaudhuri D (1991) An efficient heuristic approach to the scheduling of jobs in a flow shop. Eur J Oper Res 61:318-325
11. Paradolous PM, Pitsoulis LS, Resende MGC (1995) A parallel graps implementation for the quadractic assignment problem, pp 111-130
12. Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 6:109-133
13. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
14. Gowrishankar K, Rajendran C, Srinivasan G (2001) Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date. Eur J Oper Res 132:643-665
15. Hart JP, Shogun AW (1987) Semi greedy heuristics an empirical study. Oper Res Lett 6:107-114
16. Rajendran C, Ziegler H (1997) An efficient heuristic for scheduling in a flow shop to minimize total weighted flow time of jobs. Eur J Oper Res 103:129-138
17. Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47(1):65-74
18. Pinedo M (1995) SCHEDULING theory, algorithms and systems. Prentice- Hall, Englewood Cliffs, NJ
19. French S (1982) Sequencing and scheduling. Halsted, New York