Job Communication Characterization and its Impact on Meta-Scheduling Co-Allocated Jobs in a Mini-Grid.
William M. JonesLouis W. PangDaniel C. Stanzione Jr.Walter B. Ligon IIIPublished in: IPDPS (2004)
Keyphrases
- identical parallel machines
- job scheduling
- identical machines
- processing times
- scheduling problem
- release dates
- computational grids
- scheduling jobs
- grid environment
- release times
- single machine
- fixed number
- deteriorating jobs
- maximum lateness
- batch processing
- flowshop
- dispatching rule
- single machine scheduling problem
- parallel machines
- batch processing machines
- completion times
- production scheduling
- scheduling decisions
- job processing times
- minimize total
- grid computing
- scheduling algorithm
- parallel machine scheduling problem
- sequence dependent setup times
- number of tardy jobs
- shortest processing time
- wafer fabrication
- strongly np hard
- competitive ratio
- scheduling strategy
- precedence constraints
- single server
- weighted tardiness
- flow control
- flexible manufacturing systems
- np hard
- total weighted tardiness
- load balancing
- allocate resources
- limited capacity
- job shop scheduling problem
- resource constrained
- parallel computing
- approximation algorithms
- communication networks
- resource allocation
- unrelated parallel machines
- optimal scheduling
- job shop
- geographically distributed
- setup times
- asymptotic optimality
- grid systems