A Critical Improvement On Open Shop Scheduling Algorithm For Routing In Interconnection Networks.

Stavros Birmpilis Timotheos Aslanidis

Published in: CoRR (2017)

Keyphrases

scheduling algorithm
interconnection networks
open shop
multistage
fault tolerant
routing algorithm
response time
parallel algorithm
job shop
message passing
approximation algorithms
parallel machines
lot sizing
dynamic programming
special case
web services
flowshop
routing protocol
routing problem
shortest path