Login / Signup
A polyhedral approach to single-machine scheduling problems.
J. M. van den Akker
C. P. M. van Hoesel
Martin W. P. Savelsbergh
Published in:
Math. Program. (1999)
Keyphrases
</>
single machine scheduling problem
branch and bound algorithm
processing times
single machine
release times
precedence constraints
combinatorial optimization
convex hull
search procedure
resource consumption
scheduling problem
response time
lagrangian relaxation
deteriorating jobs
neural network