Login / Signup

New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan.

Michael AndresenTanka Nath Dhamala
Published in: Ann. Oper. Res. (2012)
Keyphrases
  • computational complexity
  • worst case
  • learning algorithm
  • space complexity
  • open shop scheduling
  • optimization problems
  • knowledge discovery
  • data mining techniques
  • computational efficiency