Login / Signup

From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective.

Dimitris BertsimasJay Sethuraman
Published in: Math. Program. (2002)
Keyphrases
  • job shop scheduling
  • scheduling problem
  • lower bound
  • computational complexity
  • np hard
  • worst case
  • objective function
  • semidefinite