Login / Signup

Minimizing makespan in re-entrant permutation flow-shops.

JC-H PanJ.-S. Chen
Published in: J. Oper. Res. Soc. (2003)
Keyphrases
  • minimizing makespan
  • scheduling problem
  • flowshop
  • total flowtime
  • processing times
  • np hard
  • special case
  • parallel machines
  • doubly stochastic
  • genetic algorithm
  • higher order
  • single machine
  • setup times