Lagrangian bounds for just-in-time job-shop scheduling.

Philippe Baptiste Marta Flamini Francis Sourd

Published in: Comput. Oper. Res. (2008)

Keyphrases

job shop scheduling
job shop scheduling problem
scheduling problem
upper bound
combinatorial optimization problems
lower bound
duality gap
lower and upper bounds
graph coloring
optimal solution
worst case
resource constraints
computational intelligence
genetic algorithm