Multiagent Scheduling (häftad)
Fler böcker inom
Format
Inbunden (Hardback)
Språk
Engelska
Antal sidor
271
Utgivningsdatum
2014-02-14
Upplaga
2014 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Billaut, Jean-Charles / Gawiejnowicz, Stanisaw
Illustrationer
55 Illustrations, black and white; XIII, 271 p. 55 illus.
Dimensioner
234 x 156 x 18 mm
Vikt
581 g
Antal komponenter
1
Komponenter
1 Hardback
ISBN
9783642418792

Multiagent Scheduling

Models and Algorithms

av Alessandro Agnetis, Jean-Charles Billaut, Stanisaw Gawiejnowicz, Dario Pacciarelli, Ameur Soukhal
Inbunden,  Engelska, 2014-02-14
1142
Köp
Spara som favorit
  • Skickas från oss inom 10-15 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
Visa alla 1 format & utgåvor
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.
Visa hela texten

Passar bra ihop

  1. Multiagent Scheduling
  2. +
  3. Autocracy, Inc

De som köpt den här boken har ofta också köpt Autocracy, Inc av Anne Applebaum (inbunden).

Köp båda 2 för 1365 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av författarna

Recensioner i media

It is very readable and precisely written. The major results are proved and 43 algorithmic descriptions are provided. The book contains also several numerical examples to illustrate the presented solution approaches. The book is recommended not only for researchers and practitioners working in scheduling, but also for graduate students since only basic knowledge in discrete mathematics, complexity theory, algorithms, and programming languages is required. (Frank Werner, Mathematical Reviews, May, 2017)

Innehållsförteckning

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.

Du kanske gillar