Login / Signup

A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective.

Victor Fernandez-ViagasJose M. Framiñan
Published in: Comput. Oper. Res. (2019)
Keyphrases
  • scheduling problem
  • processing times
  • parallel machine scheduling problem
  • iterated greedy
  • data sets
  • np hard
  • dynamic programming
  • completion times
  • knowledge base
  • optimal solution
  • multistage
  • single machine
  • flowshop