Login / Signup

An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming method.

Haoxun ChenChengbin ChuJean-Marie Proth
Published in: IEEE Trans. Robotics Autom. (1998)
Keyphrases
  • dynamic programming
  • job shop scheduling
  • cost function
  • objective function
  • bayesian networks
  • computational complexity
  • search space
  • tree structure