Login / Signup

A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times.

Mateus Rocha de PaulaGeraldo Robson MateusMartín Gómez Ravetti
Published in: Comput. Oper. Res. (2010)
Keyphrases