A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor.
Pascal BabuLaurent PéridyEric PinsonPublished in: Ann. Oper. Res. (2004)
Keyphrases
- weighted tardiness
- branch and bound algorithm
- minimize total
- single machine scheduling problem
- release dates
- parallel machines
- precedence constraints
- lower bound
- single machine
- branch and bound
- sequence dependent setup times
- upper bound
- np hard
- optimal solution
- total cost
- combinatorial optimization
- scheduling problem
- setup times
- lagrangian relaxation
- reinforcement learning
- cost function
- shared memory
- special case