Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum.
Seong-in KimJunghee HanYoungho LeeEunkyung ParkPublished in: Comput. Oper. Res. (2010)
Keyphrases
- lot sizing
- setup times
- scheduling problem
- sequence dependent setup times
- rolling horizon
- multi item
- single machine
- multistage
- single item
- flowshop
- parallel machines
- cutting stock
- production planning
- np hard
- inventory systems
- assembly systems
- mixed integer programming
- lead time
- precedence constraints
- tabu search
- mixed integer
- setup cost
- planning horizon
- stochastic inventory control
- mixed integer program
- processing times
- upper bound