Login / Signup

Minimizing the number of early jobs on a proportionate flowshop.

Baruch MorGur Mosheiov
Published in: J. Oper. Res. Soc. (2015)
Keyphrases
  • flowshop
  • scheduling problem
  • processing times
  • minimizing makespan
  • special case
  • fixed number
  • flowshop scheduling
  • open shop
  • computational complexity
  • finite number
  • parallel machines
  • number of tardy jobs