Login / Signup

A family of inequalities valid for the robust single machine scheduling polyhedron.

Ismael Regis de Farias Jr.Hongxia ZhaoMing Zhao
Published in: Comput. Oper. Res. (2010)
Keyphrases
  • single machine scheduling
  • facet defining
  • facet defining inequalities
  • single machine scheduling problem
  • special case
  • computationally efficient
  • optimization algorithm