Skip to Main Content
The problem of scheduling divisible loads on a distributed bus network with start-up costs is considered. In this paper, we present a novel algorithm to obtain one-round installment load distribution solutions by utilizing multiple data transfer streams. We demonstrate how our proposed algorithm works by means of multiple illustrative examples. We compare the makespan generated by our proposed algorithm with the others in difference cases. We conclude that our proposed algorithm can generate better makespans than others. The analysis provides deeper understanding of scheduling divisible loads in the more realistic model, which will allow us to design more efficient algorithms.