A hybrid genetic algorithm for the job shop scheduling problem

  • José Fernando Gonçalves
  • Jorge José M. Mendes
  • Mauricio G.C. Resende
    • Categories Meta Heuristics, Scheduling Tags , , , , Short URL: https://optimization-online.org/?p=9279

    This paper presents a hybrid genetic algorithm for the Job Shop Scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local search heuristic is applied to improve the solution. The approach is tested on a set of standard instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed algorithm.

    Citation

    AT&T Labs Research Technical Report TD-5EAL6J, AT&T Labs Research, 180 Park Avenune, Florham Park, NJ 07932 USA, September 2002.

    Article

    Download

    View A hybrid genetic algorithm for the job shop scheduling problem