Scheduling parallel serial-batch processing machines with incompatible job families, sequence-dependent setup times and arbitrary sizes.
Christian GahmStefan WahlAxel TumaPublished in: Int. J. Prod. Res. (2022)
Keyphrases
- batch processing machines
- maximum lateness
- sequence dependent setup times
- single machine
- parallel machines
- scheduling problem
- release dates
- single machine scheduling problem
- flowshop
- precedence constraints
- setup times
- lot sizing
- processing times
- approximation algorithms
- setup cost
- dynamic programming
- single server
- shared memory
- message passing
- optimal policy
- np hard