Login / Signup

Multiple-Machine Lower Bounds for Shop-Scheduling Problems.

Francis SourdWim Nuijten
Published in: INFORMS J. Comput. (2000)
Keyphrases
  • lower bound
  • scheduling problem
  • flowshop
  • strongly np hard
  • objective function
  • upper bound
  • np hard
  • branch and bound
  • parallel machines
  • job shop scheduling
  • optimal solution
  • sequence dependent setup times