|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
b3308587 |
| 003 |
MWH |
| 005 |
20191027151918.0 |
| 007 |
cr nn 008mamaa |
| 008 |
140131s2014 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642418808
|
| 024 |
7 |
|
|a 10.1007/978-3-642-41880-8
|2 doi
|
| 035 |
|
|
|a (DE-He213)978-3-642-41880-8
|
| 050 |
|
4 |
|a E-Book
|
| 072 |
|
7 |
|a KJT
|2 bicssc
|
| 072 |
|
7 |
|a BUS049000
|2 bisacsh
|
| 072 |
|
7 |
|a KJT
|2 thema
|
| 072 |
|
7 |
|a KJMD
|2 thema
|
| 100 |
1 |
|
|a Agnetis, Alessandro.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 245 |
1 |
0 |
|a Multiagent Scheduling
|h [electronic resource] :
|b Models and Algorithms /
|c by Alessandro Agnetis, Jean-Charles Billaut, Stanisław Gawiejnowicz, Dario Pacciarelli, Ameur Soukhal.
|
| 250 |
|
|
|a 1st ed. 2014.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2014.
|
| 300 |
|
|
|a XIII, 271 p. 55 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Springer eBook Collection
|
| 505 |
0 |
|
|a 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.
|
| 520 |
|
|
|a 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. .
|
| 590 |
|
|
|a Loaded electronically.
|
| 590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
| 650 |
|
0 |
|a Operations research.
|
| 650 |
|
0 |
|a Decision making.
|
| 650 |
|
0 |
|a Computers.
|
| 690 |
|
|
|a Electronic resources (E-books)
|
| 700 |
1 |
|
|a Billaut, Jean-Charles.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 700 |
1 |
|
|a Gawiejnowicz, Stanisław.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 700 |
1 |
|
|a Pacciarelli, Dario.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 700 |
1 |
|
|a Soukhal, Ameur.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 830 |
|
0 |
|a Springer eBook Collection.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-3-642-41880-8
|3 Click to view e-book
|
| 907 |
|
|
|a .b33085870
|b 04-18-22
|c 02-26-20
|
| 998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g gw
|h 0
|i 1
|
| 912 |
|
|
|a ZDB-2-SBE
|
| 950 |
|
|
|a Business and Economics (Springer-11643)
|
| 902 |
|
|
|a springer purchased ebooks
|
| 903 |
|
|
|a SEB-COLL
|
| 945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i22217496
|z 02-26-20
|
| 999 |
f |
f |
|i 3dc0516e-c5a8-582c-8db5-c558d72d6076
|s 7b3219a5-20e6-546a-9442-9d5d1d9aa5ea
|
| 952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|e E-Book
|h Library of Congress classification
|i Elec File
|n 1
|