A modelling approach for the dynamic scheduling problem of manufacturing systems with non negligible setup times and finite buffers.
Mauro BoccadoroPaolo ValigiPublished in: CDC (2003)
Keyphrases
- setup times
- scheduling problem
- manufacturing systems
- manufacturing cell
- single machine
- flowshop
- processing times
- multi item
- sequence dependent setup times
- lot sizing
- precedence constraints
- flexible manufacturing systems
- parallel machines
- total tardiness
- petri net
- np hard
- manufacturing environment
- production cost
- unrelated parallel machines
- single server
- single machine scheduling problem
- complex systems
- strongly np hard
- manufacturing process
- production scheduling
- release dates
- job shop scheduling problem
- branch and bound algorithm
- tabu search
- response time