Routing and scheduling field service operation by P-graph.
Márton FritsBotond BertókPublished in: Comput. Oper. Res. (2021)
Keyphrases
- scheduling problem
- service requirements
- network topology
- scheduling algorithm
- service providers
- directed graph
- scheduling policies
- graph theory
- service quality
- grid environment
- graph representation
- graph model
- weighted graph
- web services
- information services
- response time
- bipartite graph
- routing algorithm
- round robin
- admission control
- structured data
- network infrastructure
- interconnection networks
- scheduling decisions
- end users