Scheduling Multiple Divisible Loads on Heterogeneous Linear Daisy Chain Networks

摘要

In this paper, we consider a problem of scheduling multiple divisible loads on heterogenous linear networks. Our objective is to design a load distribution strategy such that the total processing time of a set of loads is a minimum. We design single and multi-installments strategies to achieve the above objective. We derive certain conditions to determine whether or not an optimum solution exists. In case an optimum solution does not exist, we propose a heuristic strategy to process the loads. We discuss the time performance, complexity and certain important features of this strategy.