Login / Signup

Minimizing the number of late jobs for the permutation flowshop problem with secondary resources.

Alex J. Ruiz-TorresGrisselle Centeno
Published in: Comput. Oper. Res. (2008)
Keyphrases
  • permutation flowshop
  • number of late jobs
  • scheduling problem
  • single machine
  • release times
  • completion times
  • upper bound
  • greedy algorithm
  • strongly np hard
  • flowshop
  • lower bound
  • branch and bound
  • processing times