The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming.
Stan P. M. van HoeselRoelof KuikMarc SalomonLuk N. Van WassenhovePublished in: Discret. Appl. Math. (1994)
Keyphrases
- lot sizing
- single item
- setup times
- dynamic programming
- scheduling problem
- multistage
- multi item
- sequence dependent setup times
- single machine
- inventory systems
- production planning
- infinite horizon
- mixed integer
- lead time
- mixed integer programming
- replenishment policy
- parallel machines
- continuous variables
- flowshop
- linear programming
- np hard
- state space
- holding cost
- planning horizon
- tabu search
- lot size
- lagrangian relaxation
- optimization problems
- ordering cost
- setup cost
- optimal policy
- computational complexity
- fixed cost
- upper bound
- markov decision processes
- processing times