Login / Signup

Elaboration of General Lower Bounds for the Total Completion Time in Flowshop Scheduling Problems through MaxPlus Approach.

Nhat Vinh VoPauline FouilletChristophe Lenté
Published in: ICORES (Selected Papers) (2014)
Keyphrases
  • lower bound
  • flowshop scheduling problems
  • special case
  • upper bound
  • objective function
  • flowshop scheduling
  • linear programming
  • computational complexity
  • np hard
  • lower bounding