A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times.
M. Duran ToksariPublished in: RAIRO Oper. Res. (2016)
Keyphrases
- single machine scheduling problem
- single machine
- setup times
- branch and bound algorithm
- scheduling problem
- sequence dependent setup times
- processing times
- precedence constraints
- release dates
- lower bound
- strongly np hard
- completion times
- upper bound
- maximum lateness
- np hard
- flowshop
- branch and bound
- minimizing makespan
- lagrangian relaxation
- reinforcement learning
- combinatorial optimization
- lot sizing
- dynamic programming
- shortest processing time
- multi item
- parallel machines
- optimal solution