Login / Signup

The tiebreaking space of constructive heuristics for the permutation flowshop minimizing makespan.

Marcus RittAlexander J. Benavides
Published in: GECCO (2021)
Keyphrases
  • total flowtime
  • minimizing makespan
  • permutation flowshop
  • scheduling problem
  • upper bound
  • greedy algorithm
  • flowshop
  • search algorithm
  • single machine
  • strongly np hard
  • lower bound