A Comparison of Genetic Algorithms for the Static Job Shop Scheduling Problem

The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been applied to the Dynamic Job Shop Scheduling Problem (DJSSP) which is more similar to real-world applications. We implement a hybrid genetic algorithm for solving the dynamic job shop problem. A direct chromosome representation, containing the schedule itself, is used. Order-based operators are combined with techniques that produce active and non-delay schedules. We refer to our algorithm as the Order-Based Giffler and Thompson (OBGT) Genetic Algorithm. OBGT is compared in terms of the quality of solutions against published solutions for benchmark problems. OBGT consistently finds better solutions on larger problems compared to several other evolutionary algorithms, including Temporal Horizon GA (THX) and Heuristically guided GA (HGA).

[1]  P. Strevens.  Iii , 1985 .

[2]  Ralf Bruns,et al.  Direct Chromosome Representation and Advanced Genetic Operators for Production Scheduling , 1993, ICGA.

[3]  L. Darrell Whitley,et al.  Modeling Simple Genetic Algorithms for Permutation Problems , 1994, FOGA.

[4]  Erik D. Goodman,et al.  Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems , 1997, Evolutionary Programming.

[5]  L. Darrell Whitley,et al.  Algorithm Performance and Problem Structure for Flow-shop Scheduling , 1999, AAAI/IAAI.

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

[7]  Kazuhiko Kawamura,et al.  Exploring Problem-Specific Recombination Operators for Job Shop Scheduling , 1991, International Conference on Genetic Algorithms.

[8]  P. Schönemann.  On artificial intelligence , 1985, Behavioral and Brain Sciences.

[9]  Erik D. Goodman,et al.  A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problem , 1997, ICGA.

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

[11]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[12]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[13]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[14]  Darrell Whitley,et al.  Genitor: a different genetic algorithm , 1988 .

[15]  Peter Ross,et al.  A Heuristic Combination Method for Solving Job-Shop Scheduling Problems , 1998, PPSN.

[16]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[17]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

[18]  Peter Ross,et al.  A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems , 1993, ICGA.

[19]  Darrell Whitley,et al.  Modeling Permutation En-codings in Simple Genetic Algorithm , 1995 .

[20]  Takeshi Yamada,et al.  A genetic algorithm with multi-step crossover for job-shop scheduling problems , 1995 .

[21]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[22]  Christian Bierwirth,et al.  Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

[23]  Stephen F. Smith,et al.  Using Genetic Algorithms to Schedule Flow Shop Releases , 1989, ICGA.

[24]  Keith E. Mathias,et al.  Sequence Scheduling With Genetic Algorithms , 1992 .

[25]  Hsiao-Lan Fang,et al.  Genetic algorithms in timetabling and scheduling , 1995 .

[26]  L. Darrell Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.

[27]  Dirk C. Mattfeld,et al.  Evolutionary Search and the Job Shop - Investigations on Genetic Algorithms for Production Scheduling , 1996, Production and Logistics.