Multiagent Scheduling: Models And Algorithms by Alessandro AgnetisMultiagent Scheduling: Models And Algorithms by Alessandro Agnetis

Multiagent Scheduling: Models And Algorithms

byAlessandro Agnetis, Jean-Charles Billaut, Stanis Gawiejnowicz

Paperback | August 27, 2016

Pricing and Purchase Info

$173.80 online 
$191.95 list price save 9%
Earn 869 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.

 

Title:Multiagent Scheduling: Models And AlgorithmsFormat:PaperbackDimensions:271 pages, 23.5 × 15.5 × 0.17 inPublished:August 27, 2016Publisher:Springer NatureLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3662506351

ISBN - 13:9783662506356

Reviews

Table of Contents

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.