Login / Signup
From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective.
Dimitris Bertsimas
David Gamarnik
Jay Sethuraman
Published in:
Oper. Res. (2003)
Keyphrases
</>
job shop scheduling
optimization problems
learning algorithm
combinatorial optimization problems
computational complexity
search algorithm
scheduling problem
simulated annealing
combinatorial optimization
benchmark problems
job shop scheduling problem