Tabu Search Algorithm For Solving of Job Shop  Scheduling with Single Objective – Makespan  Minimization

K.C.UDAIYAKUMAR; M.CHANDRASEKARAN

Volume : III, Issue : XII, December - 2013

Tabu Search Algorithm For Solving of Job Shop Scheduling with Single Objective – Makespan Minimization

K. C. Udaiyakumar, M. Chandrasekaran

Abstract :

In this paper we defiance the job shop scheduling problem with total makespan minimization. We intended to extend the disjunctive graph model used for makespan minimization to represent the translation of the problem with total makespan minimization. Using this representation, adapting local search neighbourhood structures actually defined for makespan minimization . This proposed neighbourhood structures are used in a evolutionary algorithm technique hyidised with a simple Tabu search method, one of the best and outperforming state–of–the–art methods in solving problem NP hard problem like Jssp and various other engineering problems.