Single machine scheduling with fixed lot-sizes and variable processing times.
Angela Di FebbraroRiccardo MinciardiSimona SaconePublished in: CDC (2001)
Keyphrases
- processing times
- lot size
- single machine
- scheduling problem
- single machine scheduling problem
- release dates
- completion times
- lot sizing
- total cost
- identical machines
- flowshop
- fixed number
- release times
- finite horizon
- np hard
- production cost
- precedence constraints
- resource consumption
- planning horizon
- special case
- knapsack problem
- petri net
- tabu search
- dynamic programming