Advertisement

Genetic Algorithm for Job-Shop Scheduling with Operators

  • Raúl Mencía
  • María R. Sierra
  • Carlos Mencía
  • Ramiro Varela
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6687)

Abstract

We face the job-shop scheduling problem with operators. To solve this problem we propose a new approach that combines a genetic algorithm with a new schedule generation scheme. We report results from an experimental study across conventional benchmark instances showing that our approach outperforms some current state-of-the-art methods.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agnetis, A., Flamini, M., Nicosia, G., Pacifici, A.: A job-shop problem with one additional resource type. Journal of Scheduling (2010), doi:10.1007/s10951-010-0162-4Google Scholar
  2. 2.
    Artigues, C., Lopez, P., Ayache, P.: Schedule generation schemes for the job shop problem with sequence-dependent setup times: Dominance properties and computational analysis. Annals of Operations Research 138, 21–52 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bierwirth, C.: A generalized permutation approach to jobshop scheduling with genetic algorithms. OR Spectrum 17, 87–92 (1995)CrossRefzbMATHGoogle Scholar
  4. 4.
    Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics 49, 107–127 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Giffler, B., Thompson, G.L.: Algorithms for solving production scheduling problems. Operations Research 8, 487–503 (1960)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    González, M.A., Vela, C.R., Varela, R.: A new hybrid genetic algorithm for the job shop scheduling problem with setup times. In: Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008). AAAI Press, Sidney (2008)Google Scholar
  7. 7.
    González Rodríguez, I., Vela, C.R., Puente, J., Varela, R.: A new local search for the job shop problem with uncertain durations. In: Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008). AAAI Press, Sidney (2008)Google Scholar
  8. 8.
    Mattfeld, D.C.: Evolutionary Search and the Job Shop Investigations on Genetic Algorithms for Production Scheduling. Springer, Heidelberg (1995)zbMATHGoogle Scholar
  9. 9.
    Sierra, M.R., Varela, R.: Pruning by dominance in best-first search for the job shop scheduling problem with total flow time. Journal of Intelligent Manufacturing 21(1), 111–119 (2010)CrossRefGoogle Scholar
  10. 10.
    Varela, R., Serrano, D., Sierra, M.: New codification schemas for scheduling with genetic algorithms. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 11–20. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Raúl Mencía
    • 1
  • María R. Sierra
    • 1
  • Carlos Mencía
    • 1
  • Ramiro Varela
    • 1
  1. 1.Department of Computer ScienceUniversity of OviedoGijónSpain

Personalised recommendations