An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time.
Yunpeng PanPublished in: Oper. Res. Lett. (2003)
Keyphrases
- minimize total
- branch and bound algorithm
- release dates
- precedence constraints
- single machine scheduling problem
- lower bound
- branch and bound
- optimal solution
- maximum lateness
- upper bound
- sequence dependent setup times
- parallel machines
- combinatorial optimization
- np hard
- single machine
- lagrangian relaxation
- response time
- scheduling problem
- completion times
- setup times
- processing times
- total cost
- objective function
- partially ordered
- search space
- search algorithm