Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines

This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for such problem is highly inevitable. In this paper, two different Meta-heuristics to minimize the makespan of the assumed problem are designed and they are compared in terms of their solutions. In the first phase, the simulated annealing algorithm is presented and then GRASP (Greedy Randomized Adaptive Search procedure) is presented to minimize the makespan in the single machine scheduling problem with unrelated parallel machines. It is found that the simulated annealing algorithm performs better than GRASP.

[1]  John W. Fowler,et al.  A SURVEY OF ALGORITHMS FOR SINGLE AND MULTI-OBJECTIVE UNRELATED PARALLEL-MACHINE DETERMINISTIC SCHEDULING PROBLEMS , 2004 .

[2]  Chris N. Potts,et al.  Unrelated parallel machine scheduling using local search , 1994 .

[3]  Chris N. Potts,et al.  Heuristics for scheduling unrelated parallel machines , 1991, Comput. Oper. Res..

[4]  Steef L. van de Velde.  Duality-Based Algorithms for Scheduling Unrelated Parallel Machines , 1993, INFORMS J. Comput..

[5]  Nodari Vakhania,et al.  An optimal rounding gives a better approximation for scheduling unrelated machines , 2005, Oper. Res. Lett..

[6]  N. Piersma,et al.  A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search , 1996 .

[7]  Maria J. Serna,et al.  Approximating Scheduling Unrelated Parallel Machines in Parallel , 2002, Comput. Optim. Appl..

[8]  Philippe Chrétienne,et al.  A cutting plane algorithm for the unrelated parallel machine scheduling problem , 2002, Eur. J. Oper. Res..

[9]  Martin Gairing,et al.  A faster combinatorial approximation algorithm for scheduling unrelated parallel machines , 2007, Theor. Comput. Sci..

[10]  Elias Koutsoupias,et al.  A Lower Bound for Scheduling Mechanisms , 2007, SODA '07.

[11]  Ramasamy Panneerselvam.  Production and Operations Management , 2004 .

[12]  K. Sheehan.  Online Research Methodology* , 2002 .

[13]  Burkhard Monien,et al.  Scheduling Unrelated Parallel Machines Computational Results , 2006, WEA.

[14]  Klaus Jansen,et al.  Improved Approximation Schemes for Scheduling Unrelated Parallel Machines , 2001, Math. Oper. Res..

[15]  Francis Sourd.  Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures , 2001, J. Heuristics.

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[17]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

[18]  Ethel Mokotoff,et al.  Heuristics Based on Partial Enumeration for the Unrelated Parallel Processor Scheduling Problem , 2002, Ann. Oper. Res..

[19]  M. Munot,et al.  Research Methodology , 2019, Storytelling with Data in Healthcare.

[20]  Paul G. Spirakis,et al.  Approximation schemes for scheduling and covering on unrelated machines , 2006, Theor. Comput. Sci..

[21]  C. N. Potts,et al.  Analysis of a linear programming heuristic for scheduling unrelated parallel machines , 1985, Discret. Appl. Math..

[22]  Chris N. Potts,et al.  Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach , 2005, Eur. J. Oper. Res..

[23]  Paolo Toth,et al.  Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines , 1997, Discret. Appl. Math..

[24]  Ramasamy Panneerselvam.  Design and Analysis of Algorithms , 2007 .

[25]  Dexter Kozen,et al.  The Design and Analysis of Algorithms , 1991, Texts and Monographs in Computer Science.

[26]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..