Login / Signup

Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags.

Imen HamdiTaïcir Loukil
Published in: Optim. Lett. (2015)
Keyphrases
  • upper and lower bounds
  • upper bound
  • lower bound
  • lower and upper bounds
  • dnf formulas
  • bayesian networks
  • data structure
  • special case
  • sample complexity
  • partition function