Scheduling on parallel machines with preemption and transportation delays.
Amina HanedAmeur SoukhalMourad BoudharNguyen Huynh TuongPublished in: Comput. Oper. Res. (2012)
Keyphrases
- parallel machines
- scheduling problem
- unrelated parallel machines
- sequence dependent setup times
- total tardiness
- minimize total
- precedence constraints
- massively parallel
- scheduling jobs
- weighted tardiness
- maximum lateness
- release dates
- lot sizing
- parallel computing
- single server
- decision making
- setup times
- open shop
- shared memory
- graphical models
- processing times
- flowshop
- graph cuts
- job shop scheduling problem
- np hard