Online batch scheduling on parallel machines with delivery times.
Yang FangXiwen LuPeihai LiuPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- lower bound
- parallel machines
- scheduling problem
- total tardiness
- np hard
- online learning
- sequence dependent setup times
- parallel computing
- minimize total
- unrelated parallel machines
- massively parallel
- setup times
- release dates
- single server
- precedence constraints
- shared memory
- scheduling jobs
- weighted tardiness
- open shop
- information systems