Skip to main content

Anticipation in Dynamic Optimization: The Scheduling Case

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1917))

Abstract

This contribution addresses the role of anticipation in evolutionary algorithms for dynamic optimization problems. Recent approaches have mainly focused on maintaining the population diversity as a warrant for the ability of tracking the optimum. In our paper, we show that it is also useful to anticipate changes of the environment by explicitly searching for solutions which maintain flexibility. Although this is a valid approach to all dynamic optimization problems, it seems particularly important for optimization problems where a part of the solution is fixed at each step. For the example of job shop scheduling, we suggest a measure of flexibility and show that much better solutions can be obtained when this measure is incorporated into the fitness-function.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bierwirth, C., Mattfeld, D.C., Kopfer, H. (1996): On Permutation Representations for Scheduling Problems. In Voigt et al. (eds.): Proc. of PPSN IV, Springer, Berlin, pp. 310–318

    Google Scholar 

  2. Bierwirth, C., Mattfeld, D.C. (1999): Production Scheduling and Rescheduling with Genetic Algorithms. Evolutionary Computation, 7(1), pp. 1–17

    Google Scholar 

  3. Branke, J. (1998): Creating Robust Solutions by Means of an Evolutionary Algorithm. In Eiben et al. (eds.): Proc. of PPSN V, Springer, Berlin, pp. 119–128

    Google Scholar 

  4. Branke, J. (2000): Efficient Evolutionary Algorithms for Searching Robust Solutions. To appear in: Adaptive Computing in Design and Manufacture, Springer, Berlin

    Google Scholar 

  5. Branke, J. (1999): Evolutionary Algorithms for Dynamic Optimization Problems-A Survey. Technical Report No. 387, Insitute AIFB, University of Karlsruhe, Germany

    Google Scholar 

  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

    Article  Google Scholar 

  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. Conf. on Genetic Alg., Morgan Kaufmann, San Mateo CA, pp. 481–489

    Google Scholar 

  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

    Google Scholar 

  9. Raman, N., Talbot, F.B. (1993): The Job Shop Tardiness Problem: A Decomposition Approach. EJOR, 69, pp. 187–199

    Article  MATH  Google Scholar 

  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

    Chapter  Google Scholar 

  11. Storer R., Wu, D., Vaccari, R. (1992): New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling. Man. Sci., 38, pp. 1495–1509

    MATH  Google Scholar 

  12. Tjornfelt-Jensen, M., and Hansen, T.K. (1999): Robust solutions to Job Shop problems. In Congress on Evolutionary Computation, IEEE, pp. 1138–1144

    Google Scholar 

  13. Tjornfelt-Jensen, M. (2000): Robustness based Rescheduling using GAs. Submitted to: IEEE Transaction on Evolutionary Computing

    Google Scholar 

  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

    Article  Google Scholar 

  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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Branke, J., Mattfeld, D.C. (2000). Anticipation in Dynamic Optimization: The Scheduling Case. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45356-3_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41056-0

  • Online ISBN: 978-3-540-45356-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics