An exact algorithm for an identical parallel additive machine scheduling problem with multiple processing alternatives.
Jun KimHyun-Jung KimPublished in: Int. J. Prod. Res. (2022)
Keyphrases
- scheduling problem
- flowshop
- parallel machines
- parallel processing
- identical machines
- unrelated parallel machines
- np hard
- single machine
- distributed processing
- batch processing
- precedence constraints
- minimizing makespan
- parallel machine scheduling problem
- maximum lateness
- multiple independent
- sequence dependent setup times
- processing times
- parallel architecture
- strongly np hard
- real time
- data processing
- special case
- computational complexity