A memory enhanced evolutionary algorithm for dynamic scheduling problems

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

Volumn 4974 LNCS, Issue , 2008, Pages 606-615

  Barlow, Gregory J ^a   Smith, Stephen F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATION THEORY; SCHEDULING; STANDARDS;

DIVERSITY TECHNIQUES; DYNAMIC JOB SHOP SCHEDULING; DYNAMIC OPTIMIZATION PROBLEM (DOP); DYNAMIC SCHEDULING; DYNAMIC SCHEDULING PROBLEMS; EUROPEAN; EVOLUTIONARY COMPUTATION (EC); EVOLUTIONARY COMPUTING; FITNESS LANDSCAPES; HEIDELBERG (CO); IMPROVED PERFORMANCE; SEARCH SPACES;

EVOLUTIONARY ALGORITHMS;

EID: 47249148030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78761-7_66     Document Type: Conference Paper

References (15)

1. Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, Dordrecht (2002)
2. Jin, Y., Branke, J.: Evolutionary optimization in uncertain environments - a survey. IEEE Transactions on Evolutionary Computation 9(3), 303-317 (2005)
3. Grefenstette, J.J.: Genetic algorithms for changing environments. In: Parallel Problem Solving from Nature, pp. 137-144 (1992)
4. Branke, J.: Memory enhanced evolutionary algorithms for changing optimization problems. In: Congress on Evolutionary Computation, pp. 1875-1882 (1999)
5. Branke, J., Mattfeld, D.C.: Anticipatory scheduling for dynamic job shop problems. In: AIPS Workshop on On-line Planning and Scheduling, pp. 3-10 (2002)
6. Branke, J., Mattfeld, D.C.: Anticipation and flexibility in dynamic scheduling. International Journal of Production Research 43(15), 3103-3129 (2005)
7. Morrison, R., DeJong, K.: A test problem generator for non-stationary environments. In: Congress on Evolutionary Computation, pp. 2047-2053 (1999)
8. Lin, S.C., Goodman, E.D., William, F., Punch, I.: A genetic algorithm approach to dynamic job shop scheduling problems. In: International Conference on Genetic Algorithms, pp. 481-488 (1997)
9. Bierwirth, C., Mattfeld, D.C.: Production scheduling and rescheduling with genetic algorithms. Evolutionary Computation 7(1), 1-17 (1999)
10. Chryssolouris,G.,Subramaniam,V.:Dynamicschedulingofmanufacturingjob shops using genetic algorithms. Journal of Intelligent Manufacturing 12, 281-293 (2001)
11. Vazquez, M., Whitley, L.D.: A comparison of genetic algorithms for the dynamic job shop scheduling problem. In: Genetic and Evolutionary Computation Conference, pp. 1011-1018 (2000)
12. Mattfeld, D.C., Bierwirth, C.: An efficient genetic algorithm for job shop scheduling with tardiness objectives. European Journal of Operations Research 155, 616-630 (2004)
13. Louis, S.J., McDonnell, J.: Learning with case-injected genetic algorithms. IEEE Transactions on Evolutionary Computation 8(4), 316-328 (2004)
14. Giffler, B., Thompson, G.L.: Algorithms for solving production scheduling problems. Operations Research 8(4), 487-503 (1960)
15. Bierwirth, C., Mattfeld, D.C., Kopfer, H.: On permutation representations for scheduling problems. In: Parallel Problem Solving from Nature, pp. 310-318 (1996)