Two linear programming formulations for scheduling multi-user periodic arrival tasks
Résumé
Grid scheduling handles periodic arrival of jobs by many users. A set of users share some homogeneous machines and each user has a set of independant generic periodic jobs. We tackle this problem with two linear programming models. The first one models the transitory part of a schedule until it reaches its periodic pattern. The second one models directly the schedule periodic pattern. Fairness is an important issue for grid management to avoid being congested by few users. We suggest many criteria to measure the load induced by user jobs. These criteria should favor the schedule fairness.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|