Optimizing Makespan In JSSP Using Unordered Subsequence Exchange Crossover In GA
S. SureshKumar · IOSR Journal of Computer Engineering · 2013
The objective of this paper is to minimize the makespan time in job shop scheduling problem.The JSSP is a one of the optimization problem in computer science and production environment.In order to minimize the makespan time and find out the optimal schedule special crossover technique is used i.e.Unordered Subsequence Exchange Crossover (USXX) in Genetic Algorithm (GA).Using the special cross over technique USXX the most of the benchmark results are compared and obtain the results near to optimal value of the benchmark problems.