| 000 | 03210nam a22005055i 4500 | ||
|---|---|---|---|
| 001 | vtls000544858 | ||
| 003 | RU-ToGU | ||
| 005 | 20210922083100.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 160915s2014 gw | s |||| 0|eng d | ||
| 020 |
_a9783642418808 _9978-3-642-41880-8 |
||
| 024 | 7 |
_a10.1007/978-3-642-41880-8 _2doi |
|
| 035 | _ato000544858 | ||
| 040 |
_aSpringer _cSpringer _dRU-ToGU |
||
| 050 | 4 | _aHD30.23 | |
| 072 | 7 |
_aKJT _2bicssc |
|
| 072 | 7 |
_aKJMD _2bicssc |
|
| 072 | 7 |
_aBUS049000 _2bisacsh |
|
| 082 | 0 | 4 |
_a658.40301 _223 |
| 100 | 1 |
_aAgnetis, Alessandro. _eauthor. _9452416 |
|
| 245 | 1 | 0 |
_aMultiagent Scheduling _helectronic resource _bModels and Algorithms / _cby Alessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli, Ameur Soukhal. |
| 260 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2014. |
||
| 300 |
_aXIII, 271 p. 55 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 505 | 0 | _a1. 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. | |
| 520 | _aScheduling 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. . | ||
| 650 | 0 |
_aEconomics. _9135154 |
|
| 650 | 0 |
_aComputer Science. _9155490 |
|
| 650 | 0 |
_aOperations research. _9303058 |
|
| 650 | 1 | 4 |
_aEconomics/Management Science. _9247365 |
| 650 | 2 | 4 |
_aOperation Research/Decision Theory. _9411428 |
| 650 | 2 | 4 |
_aModels and Principles. _9303228 |
| 700 | 1 |
_aBillaut, Jean-Charles. _eauthor. _9322566 |
|
| 700 | 1 |
_aGawiejnowicz, Stanisław. _eauthor. _9327699 |
|
| 700 | 1 |
_aPacciarelli, Dario. _eauthor. _9452417 |
|
| 700 | 1 |
_aSoukhal, Ameur. _eauthor. _9452418 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9143950 |
|
| 773 | 0 | _tSpringer eBooks | |
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-41880-8 |
| 912 | _aZDB-2-SBE | ||
| 999 | _c402417 | ||