A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem.
André GasconRobert C. LeachmanPublished in: Oper. Res. (1988)
Keyphrases
- multi item
- setup times
- single machine scheduling problem
- lagrangian relaxation
- dynamic programming
- single machine
- lot sizing
- branch and bound algorithm
- scheduling problem
- integer programming
- processing times
- optimal solution
- combinatorial optimization
- state space
- multistage
- search procedure
- infinite horizon
- mixed integer programming
- production cost
- precedence constraints
- column generation
- solution quality