An exact algorithm for the uncertain version of parallel machines scheduling problem with the total completion time criterion.
Marcin SiepakPublished in: SCOR (2012)
Keyphrases
- parallel machines
- scheduling problem
- total tardiness
- earliness tardiness
- unrelated parallel machines
- single machine
- precedence constraints
- sequence dependent setup times
- setup times
- flowshop
- weighted tardiness
- minimizing makespan
- np hard
- maximum lateness
- processing times
- tabu search
- minimize total
- makespan minimization
- completion times
- decision making
- scheduling jobs
- release dates
- total weighted tardiness
- massively parallel
- job shop scheduling problem
- branch and bound algorithm
- single server
- permutation flowshop
- job shop
- integer programming
- single machine scheduling problem
- parallel computing
- shared memory
- computational complexity