A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates.
Philippe BaptisteJacques CarlierAntoine JougletPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- minimize total
- release dates
- parallel machines
- sequence dependent setup times
- single machine
- single machine scheduling problem
- scheduling problem
- scheduling jobs
- processing times
- flowshop
- precedence constraints
- branch and bound
- np hard
- branch and bound algorithm
- total cost
- search algorithm
- shared memory
- lot sizing
- combinatorial optimization
- steady state
- tabu search