memetic algorithm

Hybrid heuristics for the permutation flow shop problem

  • Geraldo R. Mateus
  • Claudio N. Meneses
  • Panos M. Pardalos
  • Mauricio G.C. Resende
  • Fabiola G. Nakamura
  • Martín Gómez Ravetti
    • Categories Meta Heuristics, Production and Logistics, Scheduling Tags , , , ,

    The Flow Shop Problem (FSP) is known to be NP-hard when more than three machines are considered. Thus, for non-trivial size problem instances, heuristics are needed to find good orderings. We consider the permutation case of this problem. For this case, denoted by F|prmu|Cmax, the sequence of jobs has to remain the same at each … Read more