A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem.
Francis SourdSafia Kedad-SidhoumPublished in: J. Sched. (2008)
Keyphrases
- earliness tardiness
- branch and bound algorithm
- single machine scheduling problem
- scheduling problem
- np hard
- precedence constraints
- single machine
- lower bound
- release dates
- sequence dependent setup times
- branch and bound
- optimal solution
- dominance rules
- parallel machines
- setup times
- upper bound
- combinatorial optimization
- lagrangian relaxation
- flowshop
- processing times
- approximation algorithms
- tabu search
- upper bounding
- integer programming
- feasible solution
- completion times
- worst case
- maximum lateness
- cost function
- special case