Login / Signup

Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers.

Gerrit FärberSaïd SalhiAnna M. Coves Moreno
Published in: LSSC (2007)
Keyphrases
  • permutation flowshop
  • scheduling problem
  • upper bound
  • total flowtime