TY  - BOOK
AU  - Agnetis,Alessandro
AU  - Billaut,Jean-Charles
AU  - Gawiejnowicz,Stanisław
AU  - Pacciarelli,Dario
AU  - Soukhal,Ameur
ED  - SpringerLink (Online service)
TI  - Multiagent Scheduling: Models and Algorithms 
SN  - 9783642418808
AV  - HD30.23 
U1  - 658.40301 23
PY  - 2014///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg, Imprint: Springer
KW  - Economics
KW  - Computer Science
KW  - Operations research
KW  - Economics/Management Science
KW  - Operation Research/Decision Theory
KW  - Models and Principles
N1  - 1. Multiagent Scheduling Fundamentals -- 2. Problems, Algorithms and Complexity -- 3. Single Machine Problems -- 4. Batching Scheduling Problems -- 5. Parallel Machine Scheduling Problems -- 6. Scheduling Problems with Variable Job Processing Times -- References
N2  - Scheduling theory has received a growing interest since its origins in the second half of the 20th century. Developed initially for the study of scheduling problems with a single objective, the theory has been recently extended to problems involving multiple criteria. However, this extension has still left a gap between the classical multi-criteria approaches and some real-life problems in which not all jobs contribute to the evaluation of each criterion. In this book, we close this gap by presenting and developing multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. Several scenarios are introduced, depending on the definition and the intersection structure of the job subsets. Complexity results, approximation schemes, heuristics and exact algorithms are discussed for single-machine and parallel-machine scheduling environments. Definitions and algorithms are illustrated with the help of examples and figures.  
UR  - http://dx.doi.org/10.1007/978-3-642-41880-8
ER  -