Anticipation in dynamic optimization: The scheduling Case

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

Volumn 1917, Issue , 2000, Pages 253-262

  Branke, Jiirgen ^a   Mattfeld, Dirk C ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

Anticipation; Dynamic optimization problems; Dynamic stochastic job shop scheduling; Evolutionary algorithm

Indexed keywords

EVOLUTIONARY ALGORITHMS; OPTIMIZATION; SCHEDULING; STOCHASTIC SYSTEMS;

ANTICIPATION; DYNAMIC OPTIMIZATION; DYNAMIC OPTIMIZATION PROBLEM (DOP); FITNESS FUNCTIONS; OPTIMIZATION PROBLEMS; POPULATION DIVERSITY; STOCHASTIC JOB SHOP SCHEDULING;

JOB SHOP SCHEDULING;

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

References (15)

1. Bierwirth, C, Mattfeld, D.C., Kopfer, H. (1996): On Permutation Representations for Scheduling Problems. In Voigt et al. (eds.): Proc. of PPSN 4, Springer, Berlin, pp. 310-318
2. Bierwirth, C, Mattfeld, D.C. (1999): Production Scheduling and Rescheduling with Genetic Algorithms. Evolutionary Computation, 7(1), pp. 1-17
3. Branke, J. (1998): Creating Robust Solutions by Means of an Evolutionary Algorithm. In Eiben et al. (eds.): Proc. of PPSN 5, Springer, Berlin, pp. 119-128
4. Branke, J. (2000): Efficient Evolutionary Algorithms for Searching Robust Solutions. To appear in: Adaptive Computing in Design and Manufacture, Springer, Berlin
5. Branke, J. (1999): Evolutionary Algorithms for Dynamic Optimization Problems-A Survey. Technical Report No. 387, Insitute AIFB, University of Karlsruhe, Germany
6. Cheng, R., Gen, M., Tsujimura, Y. (1996): A Tutorial Survey of Job-Shop Scheduling Problems Using Genetic Algorithms. Comp. Ind. Engng., 30, pp. 983-997
7. Lin, S., Goodman, E., Punch, W. (1997): A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problems. In Bäck T. (ed.): Proc. of the 7th Int. Gonf. on Genetic Alg., Morgan Kaufmann, San Mateo CA, pp. 481-489
8. Mattfeld, D.C, Bierwirth, C. (1998): Minimizing Job Tardiness: Priority Rules vs. Adaptive Scheduling. In Parmee, I.C. (ed.): Adaptive Computing in Design and Manufacture, Springer, London, pp. 59-67
9. Raman, N., Talbot, F.B. (1993): The Job Shop Tardiness Problem: A Decomposition Approach. EJOR, 69, pp. 187-199
10. Sgall, J. (1998): On-line Scheduling. In Fiat, A., Woeginger, G.J. (eds.): Online Algorithms: The State of the Art. Springer, Berlin, pp. 196-232
11. Storer R., Wu, D., Vaccari, R. (1992): New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling. Man. Sei., 38, pp. 1495-1509
12. Tjornfelt-Jensen, M., and Hansen, T.K. (1999): Robust solutions to Job Shop problems. In Congress on Evolutionary Computation, IEEE, pp. 1138-1144
13. Tjornfelt-Jensen, M.(2000): Robustness based Rescheduling using GAs. Submitted to: IEEE Transaction on Evolutionary Computing
14. Tsutsui, S. and Ghosh, A. (1997): Genetic Algorithms with a Robust Solution Searching Scheme. In: IEEE Transactions on Evolutionary Computation, 1(3), pp. 201-208
15. Vepsalainen, A.P.J., Morton, T.E. (1987): Priority Rules for Job Shops with Weighted Tardiness Costs. Man. Sci., 33(8), pp. 1035-1047