Login / Signup

A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop.

Marcelo Seido NaganoFernando Luis RossiCaio Paziani Tomazella
Published in: Prod. Eng. (2017)
Keyphrases
  • total tardiness
  • scheduling problem
  • flowshop
  • cost function
  • objective function
  • dynamic programming
  • optimization algorithm
  • combinatorial optimization
  • simulated annealing
  • tabu search