Optimizing Makespan In JSSP Using Unordered Subsequence Exchange Crossover In GA

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. Keywords-JSSP; Makespan time; Genetic Algorithm; USXX;

[1]  Pierre Borne,et al.  EVOLUTIONARY ALGORITHMS FOR JOB-SHOP SCHEDULING , 2004 .

[2]  S. Sumathi,et al.  Solving Fuzzy based Job Shop Scheduling Problems using Ga and Aco , 2010 .

[3]  Michael Bögl,et al.  Metaheuristic Search Concepts , 2010 .

[4]  Hiresh Soltanpanah,et al.  Considering The Flexibility and Overlapping in Operation in Job Shop Scheduling Based on Meta-heuristic Algorithms , 2011 .

[5]  S. Sumathi,et al.  Solution to the Job Shop Scheduling Problem using Hybrid Genetic Swarm Optimization based on (λ,1) Fuzzy Processing Time , 2011 .

[6]  R. A. Mahdavinejad.  A new approach to job shop-scheduling problem , 2010 .

[7]  P. Dhavachelvan,et al.  Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling , 2012 .

[8]  Allan Glaser,et al.  Scheduling Programming Activities and Johnson's Algorithm , 2010 .

[9]  Mostafa Akhshabi,et al.  Solving flexible job-shop scheduling problem using clonal selection algorithm , 2011 .

[10]  Hidekazu Terai,et al.  A new genetic coding for job shop scheduling problem considering geno type and pheno type , 2010 .

[11]  A. K. M. Masud,et al.  Approach to Job-Shop Scheduling Problem Using Rule Extraction Neural Network Model , 2011 .

[12]  Payam Ghanbari,et al.  A Simulated Annealing for the Single Machine Batch Scheduling with Deterioration and Precedence Constraints , 2012 .

[13]  A. Tamilarasi,et al.  An enhanced genetic algorithm with simulated annealing for job-shop scheduling , 2010 .

[14]  C. Bierwirth.  A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[15]  Balasubramanie Palanisamy,et al.  Hybridization of Genetic Algorithm with Parallel Implementation of Simulated Annealing for Job Shop Scheduling , 2012 .

[16]  Yanchun Liang,et al.  Solving Job Shop Scheduling Problem Using Genetic Algorithm with Penalty Function , 2010, Int. J. Intell. Inf. Process..

[17]  Ye Li,et al.  A Genetic Algorithm for Job-Shop Scheduling , 2010, J. Softw..

[18]  R. Moghaddas,et al.  Job-Shop Scheduling Problem With Sequence Dependent Setup Times , 2022 .

[19]  Ruhul A. Sarker,et al.  GA with priority rules for solving Job-Shop Scheduling Problems , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[20]  P. Balasubramanie,et al.  Analysis of Various Alternate Crossover Strategies for Genetic Algorithm to Solve Job Shop Scheduling Problems , 2011 .