Login / Signup

Efficient constructive and composite heuristics for the Permutation Flowshop to minimise total earliness and tardiness.

Victor Fernandez-ViagasManuel DiosJose M. Framiñan
Published in: Comput. Oper. Res. (2016)
Keyphrases
  • permutation flowshop
  • scheduling problem
  • upper bound
  • objective function
  • message passing