Comparative Study of Different Representations in Genetic Algorithms for Job Shop Scheduling Problem

Due to NP-Hard nature of the Job Shop Scheduling Problems (JSP), exact methods fail to provide the optimal solutions in quite reasonable computational time. Due to this nature of the problem, so many heuristics and meta-heuristics have been proposed in the past to get optimal or near-optimal solutions for easy to tough JSP instances in lesser computational time compared to exact methods. One of such heuristics is genetic algorithm (GA). Representations in GA will have a direct impact on computational time it takes in providing optimal or near optimal solutions. Different representation schemes are possible in case of Job Scheduling Problems. These schemes in turn will have a higher impact on the performance of GA. It is intended to show through this paper, how these representations will perform, by a comparative analysis based on average deviation, evolution of solution over entire generations etc.

[1]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[2]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[3]  Peter Brucker,et al.  Complex Scheduling , 2006 .

[4]  YoungSu Yun.  Genetic algorithm with fuzzy logic controller for preemptive and non-preemptive job-shop scheduling problems , 2002 .

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

[6]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[7]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[8]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[9]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[10]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[11]  Tamer F. Abdelmaguid.  Representations in Genetic Algorithm for the Job Shop Scheduling Problem: A Computational Study , 2010, J. Softw. Eng. Appl..

[12]  Tamer F. Abdelmaguid.  Permutation-induced acyclic networks for the job shop scheduling problem , 2009 .

[13]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[14]  Varghese S. Jacob,et al.  A genetics-based hybrid scheduler for generating static schedules in flexible manufacturing contexts , 1993, IEEE Trans. Syst. Man Cybern..

[15]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[16]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[17]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[18]  S. G. Ponnambalam,et al.  Hybrid Search Heuristics to Schedule Bottleneck Facility in Manufacturing Systems , 2007 .

[19]  John W. Fowler,et al.  Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops , 2007, Eur. J. Oper. Res..

[20]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

[21]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[22]  T. Yamada,et al.  Job shop scheduling , 1997 .

[23]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[24]  Peter Brucker,et al.  Job-shop Scheduling Problem , 2009, Encyclopedia of Optimization.