A comparison of genetic algorithms for the static job shop scheduling problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1917, Issue , 2000, Pages 303-312

  Vazquez, Manuel ^a   Whitley, Darrell ^a  

^a Department of Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; CHROMOSOMES; GENETIC ALGORITHMS; SCHEDULING; TABU SEARCH;

BENCH-MARK PROBLEMS; JOB SHOP SCHEDULING PROBLEMS; LOCAL SEARCH; PARALLEL GA; QUALITY OF SOLUTION; STATE OF THE ART; TABU SEARCH ALGORITHMS; TEST PROBLEM;

JOB SHOP SCHEDULING;

EID: 84947902716     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45356-3_30     Document Type: Conference Paper

References (22)

1. S. Bagchi, S. Uckum and Y. Miyabe, Kawamura, K. [1991]. “Exploring Problem-Specific Recombination Operators for Job Shop Scheduling”. ICGA-91.
2. C. Bierwirth and D. Mattfeld [1999]. “Production Scheduling and Rescheduling with Genetic Algorithms”. Evolutionary Computation, 7(1):1-16, 1999.
3. R. Bruns [1993]. “Direct Chromosome Representation and Advanced Genetic Operators for Production Scheduling”. International Conf. Genetic Algorithms (ICGA-93).
4. L. Davis [1991]. “Order-Based Genetic Algorithm and the Graph Coloring Problem”. In Handbook of Genetic Algorithms, Chapter 6.
5. L. Davis [1985]. “Job Shop scheduling with Genetic Algorithms”. International Conf. Genetic Algorithms (ICGA-85).
6. H. Fang [1994]. Ph.D. Thesis. “Genetic Algorithms in Timetabling and Scheduling", Dept. Artificial Intelligence. University of Edinburgh, Scotland.
7. E. Hart and P. Ross [1998]. “A Heuristic Combination Method for Solving Job-Shop Scheduling Problems”. Parallel Problem Solving from Nature 5.
8. A.S. Jain, S. Meeran [1999]. “Deterministic Job-Shop Scheduling: Past, Present and Future”. European Journal of Operations Research (to appear in Volume 118, Issue 2).
9. A.S. Jain, S. Meeran [1998a]. “A State-of-the-art review of Job-Shop Scheduling techniques”. Submitted to Journal of Heuristics.
10. A.S. Jain, B. Rangaswamy, S. Meeran [1998b]. “Job Shop Neighborhoods and Move Evaluation Strategies”. Journal of Scheduling. Submitted for Publication.
11. S. Lin, E.D. Goodman, W.F. Punch, III [1997a]. “A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problems”. ICG A-97.
12. S. Lin, E.D. Goodman, W.F. Punch, III [1997b]. “Investigating Parallel Algorithms on Job Shop Scheduling Problems”. Evolutionary Programming Conference.
13. Nowicki, E. and Smutnicki, C. [1996]. “A Fast Taboo Search Algorithm for the Job-Shop Problem”. Management Science, 42(6), 797-813.
14. D.C. Mattfeld [1996]. “Evolutionary Search and the Job Shop”. Physica-Verlag, 1996.
15. T.E. Morton and D.W. Pentico [1993]. “Heuristic Scheduling Systems”. John Wiley and Sons, 1993.
16. R. Nakano, T. Yamada [1991]. “Conventional Genetic Algorithms for Job Shop Problems”. ICGA-91.
17. G. Syswerda [1991]. “Schedule Optimization Using Genetic Algorithms”. Handbook of Genetic Algorithms, Chapter 21.
18. M. Vazquez and D. Whitley [2000]. “A comparison of Genetic Algorithms in solving the Dynamic Job Shop Scheduling Problem”. GECCO 2000.
19. J.P. Watson, L. Barbulescu, A.E. Howe and D. Whitley [1999]. “Algorithm Performance and Problem Structure in Flow-Shop Scheduling”. AAAI-99.
20. D. Whitley and J. Kauth [1988]. “GENITOR: A different Genetic Algorithm”. In. Rocky Mountain Conf. on Artificial Intelligence.
21. D. Whitley and N. Yoo [1995]. Modeling Simple Genetic Algorithms for Permutation Problems. In Foundations of Genetic algorithms-3. Morgan Kaufmann.
22. T. Yamada and R. Nakano [1992]. “A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems”. In Parallel Problem Solving from Nature 2 (PPSN 2).