A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time.
J. A. HoogeveenSteef L. van de VeldePublished in: INFORMS J. Comput. (1996)
Keyphrases
- branch and bound algorithm
- single machine
- single machine scheduling problem
- scheduling problem
- np hard
- lower bound
- branch and bound
- earliness tardiness
- release times
- release dates
- optimal solution
- upper bound
- precedence constraints
- sequence dependent setup times
- maximum lateness
- combinatorial optimization
- lower bounding
- processing times
- lagrangian relaxation
- dynamic programming
- setup times
- weighted number of tardy jobs
- number of late jobs
- parallel computing
- genetic algorithm
- approximation algorithms
- multistage
- np complete
- scheduling jobs
- special case