Deriving good transformations for mapping nested loops on hierarchical parallel machines in polynomial time.
Kamlesh G. KumarDattatraya KulkarniAnupam BasuPublished in: ICS (1992)
Keyphrases
- parallel machines
- scheduling problem
- total tardiness
- unrelated parallel machines
- hierarchical structure
- minimize total
- precedence constraints
- sequence dependent setup times
- special case
- scheduling jobs
- parallel computing
- massively parallel
- release dates
- worst case
- setup times
- approximation algorithms
- computational complexity
- single server
- flowshop
- single machine
- weighted tardiness
- reinforcement learning