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

@inproceedings{Vzquez2000ACO,
  title={A Comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem},
  author={Manuel V{\'a}zquez and L. Darrell Whitley},
  booktitle={GECCO},
  year={2000}
}
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… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Iii

  • S. Lin, E. D. Goodman, W. F. Punch
  • \Investigating Parallel Algorithms on Job Shop…
  • 1997
Highly Influential
9 Excerpts

Job Shop Neighborhoods and Move Eval uation Strategies

  • A.S.Jain, B. Rangaswamy, S. Meeran
  • Journal of Scheduling. Submitted for Publication,
  • 1998
Highly Influential
8 Excerpts

Modeling Permutation Encodings in Simple Genetic Algorithm

  • D. Whitley, N. Yoo
  • In Foundations of Genetic Algorithms (FOGA) 3,
  • 1995
Highly Influential
3 Excerpts

A comparison of Genetic Algorithms in solving the Dynamic Job Shop Scheduling Problem

  • M. V azquez, D. Whitley
  • Submitted to Genetic and Evolution ary…
  • 2000
3 Excerpts

Similar Papers

Loading similar papers…