Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs.
Patrizia BeraldiGianpaolo GhianiAntonio GriecoEmanuela GuerrieroPublished in: Comput. Oper. Res. (2008)
Keyphrases
- lot sizing
- rolling horizon
- parallel machines
- scheduling problem
- single machine
- setup times
- single item
- sequence dependent setup times
- multistage
- earliness tardiness
- multi item
- setup cost
- total tardiness
- list scheduling
- lead time
- release dates
- mixed integer programming
- cutting stock
- production planning
- maximum lateness
- fixed cost
- unrelated parallel machines
- planning horizon
- tabu search
- precedence constraints
- minimizing makespan
- processing times
- flowshop
- decision making
- production system
- probability distribution