Minimising total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times.
Jae-Gon KimSeokwoo SongBongJoo JeongPublished in: Int. J. Prod. Res. (2020)
Keyphrases
- sequence dependent setup times
- total tardiness
- parallel machine scheduling problem
- single machine
- parallel machines
- total weighted tardiness
- scheduling problem
- single machine scheduling problem
- release dates
- flowshop
- setup times
- maximum lateness
- precedence constraints
- processing times
- lot sizing
- branch and bound algorithm
- job shop scheduling problem
- shared memory
- parallel computing
- single server
- np hard