Sign in
The relation of time indexed formulations of single machine scheduling problems to the node packing problem.
Hamish Waterer
Ellis L. Johnson
Paolo Nobili
Martin W. P. Savelsbergh
Published in:
Math. Program. (2002)
Keyphrases
</>
packing problem
single machine scheduling problem
integer programming
release times
precedence constraints
arbitrary shaped
branch and bound algorithm
single machine
processing times
lagrangian relaxation
valid inequalities
combinatorial optimization
resource consumption
lower bound
search procedure