Divisible load applications consist of an amount of data and associated computation that can be divided arbitrarily into any number of independent pieces. Thismodel is a good approximation of many real-world scientific applications, lends itself to a natural master-worker implementation, and has thus received a lot of attention. The issue of divisible load scheduling has been studied extensively. However, only a few authors have explored the simultaneous scheduling of multiple such applications on a distributed computing platform.Wefocus on this increasingly relevant scenario and make the following contributions. We use a novel and more realistic platform model that captures some of the fundamental network properties of grid platforms. We formulate the steady-state multiapplication scheduling problem as a linear program that expresses a notion of fairness between applications. This scheduling problem is NP-complete and we propose several heuristics that we evaluate and compare via extensive simulation experiments. Our main finding is that some of our heuristics can achieve performance close to optimal and we quantify the trade-offs between achieved performance and heuristic complexity.