Name
Abstract | ||
|---|---|---|
In this paper, we consider the problem of scheduling independent jobs when several agents compete to perform their jobs on a common single processing machine. Each agent wants to minimise its cost function, which depends exclusively on its jobs and we assume that a global cost function concerning the whole set of jobs has to be minimised. This cost function may correspond to the global performance of the workshop or to the global objective of the company, independent of the objectives of the agents. Classical regular objective functions are considered and both the 驴-constraint and a linear combination of criteria are used for finding compromise solutions. This new multi-agent scheduling problem is introduced into the literature and simple reductions with multicriteria scheduling and multi-agent scheduling problems are established. In addition, the complexity results of several problems are proposed and a dynamic programming algorithm is given. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s10951-011-0252-y | J. Scheduling |
Keywords | Field | DocType |
Scheduling,Multi-agent,Single machine,Complexity,Dynamic programming | Mathematical optimization,Multiprocessor scheduling,Job shop scheduling,Fair-share scheduling,Computer science,Flow shop scheduling,Real-time computing,Two-level scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling | Journal |
Volume | Issue | ISSN |
15 | 3 | 1094-6136 |
Citations | PageRank | References |
16 | 0.72 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| N. Huynh Tuong | 1 | 16 | 0.72 |
| Ameur Soukhal | 2 | 119 | 10.15 |
| J.-C. Billaut | 3 | 73 | 5.79 |