A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem.
Ching-Fang LiawPublished in: Comput. Oper. Res. (1999)
Keyphrases
- single machine
- branch and bound algorithm
- scheduling problem
- np hard
- dominance rules
- precedence constraints
- lower bound
- total weighted tardiness
- earliness tardiness
- maximum lateness
- branch and bound
- processing times
- optimal solution
- single machine scheduling problem
- sequence dependent setup times
- release dates
- scheduling jobs
- upper bound
- lower bounding
- total tardiness
- setup times
- flowshop
- parallel machines
- special case
- approximation algorithms
- competitive ratio
- job shop scheduling problem
- tabu search
- np complete
- computational complexity
- production scheduling
- integer programming
- job shop
- weighted tardiness
- lagrangian relaxation
- combinatorial optimization
- strongly np hard
- linear programming
- knapsack problem