Minimizing the total weighted completion time on unrelated parallel machines with stochastic times.
Jean-Paul M. ArnaoutGhaith RabadiPublished in: WSC (2005)
Keyphrases
- unrelated parallel machines
- parallel machines
- scheduling problem
- completion times
- single machine
- processing times
- setup times
- flowshop
- precedence constraints
- single machine scheduling problem
- open shop
- sequence dependent setup times
- release dates
- np hard
- job shop scheduling
- single server
- shared memory
- weighted sum
- lot sizing
- computational complexity
- parallel computing
- lower bound