ASTEC 2009 Workshop/Summer school on Algorithms and Techniques for Scheduling on Clusters and Grids

Scheduling Multi-User Periodic Arrival of Tasks : Two Linear Programming Formulations

We are studying cyclic scheduling with many users. Users share a set of homogeneous machines. Each user submits periodically a set of independent tasks. We approach this problem with two linear programs: The first one models the scheduling of a transitional phase until the establishment of the permanent flow. The second model works directly on the periodical pattern. We take into account the fairness between users to prevent few users bringing system congestion. For this we suggest several criteria for measuring the load induced by users tasks.