Login / Signup

Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity.

Mohamed Ali AloulouMikhail Y. KovalyovMarie-Claude Portmann
Published in: RAIRO Oper. Res. (2007)
Keyphrases
  • objective function
  • computational complexity
  • optimal solution
  • single machine scheduling
  • feasible solution
  • lower bound
  • multi objective
  • np hard
  • dynamic programming
  • markov random field
  • greedy algorithm