Precedence theorems and dynamic programming for the single-machine weighted tardiness problem.
Salim RostamiStefan CreemersRoel LeusPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- weighted tardiness
- single machine
- dynamic programming
- scheduling problem
- minimize total
- precedence constraints
- single machine scheduling problem
- processing times
- sequence dependent setup times
- release dates
- setup times
- partial order
- multistage
- knapsack problem
- linear programming
- infinite horizon
- evolutionary algorithm