Multi-cost job routing and scheduling in Grid networks.
Tim StevensMarc De LeenheerChris DevelderBart DhoedtKostas ChristodoulopoulosPanagiotis C. KokkinosEmmanouel A. VarvarigosPublished in: Future Gener. Comput. Syst. (2009)
Keyphrases
- scheduling decisions
- network topologies
- job scheduling
- computational grids
- scheduling problem
- release dates
- scheduling algorithm
- job processing times
- batch processing
- grid environment
- network topology
- job shop
- identical machines
- interconnection networks
- traffic engineering
- processing times
- routing algorithm
- network structure
- wireless ad hoc networks
- scheduling jobs
- identical parallel machines
- link failure
- dynamic routing
- social networks
- path selection
- ad hoc networks
- routing protocol
- qos parameters
- shortest path
- computer networks
- production scheduling
- parallel machines
- grid computing
- routing decisions
- flowshop
- release times
- transport network
- material handling
- single machine scheduling problem
- resource consumption
- path length
- total cost
- routing problem
- flexible manufacturing systems
- end to end
- switched networks
- quality of service
- completion times
- heterogeneous networks
- packet forwarding
- network resources