Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem.
Andreas WeidenhillerHerbert JodlbauerPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- equivalence classes
- lot sizing
- setup times
- scheduling problem
- rolling horizon
- equivalence class
- single machine
- multi item
- multistage
- flowshop
- single item
- bayesian network structures
- parallel machines
- mixed integer
- production planning
- cutting stock
- mixed integer programming
- directed acyclic graph
- assembly systems
- mixed integer program
- tabu search
- np hard
- markov chain
- lead time
- planning horizon
- processing times
- setup cost
- optimal control
- precedence constraints
- valid inequalities
- lot size
- state space
- release dates
- resource allocation
- fixed cost
- lower bound