Open Access Open Access  Restricted Access Subscription Access

Difference between the Simulated Annealing Algorithm and GRASP, In Terms of their Performance

Sivasankaran Swamy

Abstract


This paper talks about configuration and correlation of Simulated Annealing Algorithm and Greedy Randomized Versatile Search Procedure (GRASP) to minimize the makespan in planning n single operation autonomous employments on m random parallel machines. This issue of minimizing the makespan in single machine planning issue with uniform parallel machines is NP hard. Consequently, heuristic advancement for such issue is very unavoidable. In this paper, two distinctive Meta-heuristics to minimize the makespan of the accepted issue are planned and they are looked at as far as their answers. In the primary stage, the reproduced strengthening calculation is displayed and after that GRASP (Greedy Randomized Adaptive Search technique) is displayed to minimize the makespan in the single machine booking issue with disconnected parallel machines. It is found that the reproduced strengthening calculation performs superior to anything GRASP. 


Full Text:

PDF

References


R. Panneerselvam. Generation and operations management. Second Edition, PHI Learning Private Limited, New Delhi; 2005.

R. Panneerselvam. Configuration and analysis of algorithms. PHI Learning Private Limited, New Delhi; 2007.

E. L. Lawler, J. Labetoulle. On preemptive scheduling on unrelated parallel processors by linear programming. Diary of the ACM. 1978; 25(4): 612–619p.

C. N. Potts. Examination of a linear programming heuristic for scheduling unrelated parallel machines. Discrete Connected Mathematics. 1985; 10(2); 155–164p.

S. L. Van De Velde. Duality-based algorithms for planning unrelated parallel machines.ORSA Journal of Computing.1993; 5(2): 182–205p.

C. A. Glass, C. N. Potts, P. Shade. Irrelevant parallel machine scheduling using local search. Mathematical also, Computer Modeling. 1994; 20(2): 41–52p.

A. M. A. Hariri, C. N. Potts. Heuristics for scheduling disconnected parallel machines.Computers and Operation Research. 1991; 18(3): 323–331p.


Refbacks

  • There are currently no refbacks.