An optimal scheduling problem for a system with finite buffers and non-negligible setup times and costs.
Vincenzo ImbastariFrancesco MartinelliPaolo ValigiPublished in: CDC (2002)
Keyphrases
- setup times
- scheduling problem
- base stock policies
- strongly np hard
- setup cost
- single machine
- flowshop
- lot sizing
- processing times
- multi item
- sequence dependent setup times
- precedence constraints
- single server
- total tardiness
- parallel machines
- holding cost
- unrelated parallel machines
- single machine scheduling problem
- np hard
- expected cost
- tabu search
- production cost
- release dates
- manufacturing cell
- dynamic programming
- lagrangian relaxation
- total cost
- linear programming
- upper bound