Issue |
RAIRO-Oper. Res.
Volume 48, Number 2, April-June 2014
Isco 2012, guest editors Nelson Maculan, A. Ridha Mahjoub, Eduardo Uchoa
|
|
---|---|---|
Page(s) | 255 - 269 | |
DOI | https://doi.org/10.1051/ro/2014005 | |
Published online | 07 March 2014 |
Solving multi-agent scheduling problems on parallel machines with a global objective function
UniversitéFrançois-Rabelais de Tours, CNRS, LI EA 6300, OC ERL CNRS 6305, 64 avenue Jean Portalis, 37200 Tours, France.
faiza.sadi@univ-tours.fr, ameur.soukhal@univ-tours.fr, jean-charles.billaut@univ-tours.fr
Received:
11
September
2013
Accepted:
28
November
2013
In this study, we consider a scheduling environment with m(m ≥ 1) parallel machines. The set of jobs to schedule is divided into K disjoint subsets. Each subset of jobs is associated with one agent. The K agents compete to perform their jobs on common resources. The objective is to find a schedule that minimizes a global objective function f 0, while maintaining the regular objective function of each agent, f k, at a level no greater than a fixed value, εk (fk ∈ {fkmax, ∑fk}, k = 0, ..., K). This problem is a multi-agent scheduling problem with a global objective function. In this study, we consider the case with preemption and the case without preemption. If preemption is allowed, we propose a polynomial time algorithm based on a network flow approach for the unrelated parallel machine case. If preemption is not allowed, we propose some general complexity results and develop dynamic programming algorithms.
Mathematics Subject Classification: 90C39
Key words: Scheduling / multi-agent / complexity / dynamic programming
© EDP Sciences, ROADEF, SMAI, 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.