A Study of Roulette Wheel and Elite Selection on GA to Solve Job Shop Scheduling

  • Sandhya Pasala
  • Balla Nandana Kumar
  • Suresh Chandra Satapathy
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 199)

Abstract

Usage of Genetic algorithm to solve NP hard problems like job shop scheduling yields remarkable results. The choice of crossover and mutation parameters however effect the GA performance and still the selection off -springs plays a major role in tuning the GA performance and has remarkable significance in controlling early convergence or local convergence. In this paper we tried to study the results of roulette wheel and elite selection process on a linear chromosome structure.

Keywords

Genetic Algorithm Job Shop Scheduling Roulette wheel Elite Selection 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Essafi, I., Mati, Y., Dauzere-Peres, S.: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Computers & Operations Research 35, 2599–2616 (2008)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: past, present and future. European Journal of Operational Research 113(2), 390–434 (1999)CrossRefMATHGoogle Scholar
  3. 3.
    Volta, R., Della Croce, G., Tadei, F.: A genetic algorithm for the job shop scheduling problem. Computers and Operations Research 22, 15–24 (1995)CrossRefMATHGoogle Scholar
  4. 4.
    Xing, L.-N., Chen, Y.-W., Yang, K.-W.: Multiobjective flexible job shop schedule: Design and evaluation by simulation modeling. Applied Soft Computing 9, 362–376 (2009)CrossRefGoogle Scholar
  5. 5.
    Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job shop scheduling by simulated annealing. Computers and Operations Research 40(1), 113–125 (1992)CrossRefMATHGoogle Scholar
  6. 6.
    Waligora, G.: Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation. European Journal of Operational Research 193, 849–856 (2009)CrossRefMATHGoogle Scholar
  7. 7.
    Vilcot, G., Billaut, J.-C.: A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem. European Journal of Operational Research 190, 398–411 (2008)CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Lourenco, H.R.: Job-shop scheduling: computational study of local search and large-step optimization methods. European Journal of Operational Research 83, 347–364 (1995)CrossRefMATHGoogle Scholar
  9. 9.
    Kacem, I., Hammadi, S., Borne, P.: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man, and Cybernetics, Part C 32(1), 1–13 (2002)CrossRefGoogle Scholar
  10. 10.
    Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the Flexible Job-shop Scheduling Problem. Computers & Operations Research 35, 3202–3212 (2008)CrossRefMATHGoogle Scholar
  11. 11.
    Lee, K.M., Yamakawa, T., Lee, K.M.: A genetic algorithm for general machine scheduling problems. International Journal of Knowledge-Based Electronic 2, 60–66 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Sandhya Pasala
    • 1
  • Balla Nandana Kumar
    • 1
  • Suresh Chandra Satapathy
    • 1
  1. 1.Swarnandhra College of Engineering and TechnologyANITSVhskapatnamIndia

Personalised recommendations