Approximate throughput maximization in scheduling of parallel jobs on hypercubes.
Ondrej ZajícekPublished in: ITAT (2010)
Keyphrases
- identical machines
- batch processing machines
- parallel machines
- processing times
- scheduling problem
- scheduling policies
- single machine
- maximum lateness
- job scheduling
- identical parallel machines
- precedence constraints
- minimize total
- scheduling jobs
- release dates
- response time
- setup times
- unrelated parallel machines
- shared memory
- optimal scheduling
- resource utilization
- precedence relations
- release times
- round robin
- objective function
- weighted tardiness
- scheduling strategy
- wafer fabrication
- batch processing
- polynomial time approximation
- parallel programming
- distributed memory
- load balancing
- parallel computing
- fixed number
- flowshop
- deteriorating jobs
- sequence dependent setup times
- computational grids
- parallel processing
- scheduling decisions
- parallel implementation
- resource allocation
- scheduling algorithm
- dynamic programming