Multiagent Scheduling: Models and Algorithms

Author:   Alessandro Agnetis ,  Jean-Charles Billaut ,  Stanisław Gawiejnowicz ,  Dario Pacciarelli
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   Softcover reprint of the original 1st ed. 2014
ISBN:  

9783662506356


Pages:   271
Publication Date:   27 August 2016
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $290.37 Quantity:  
Add to Cart

Share |

Multiagent Scheduling: Models and Algorithms


Add your own review!

Overview

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.

Full Product Details

Author:   Alessandro Agnetis ,  Jean-Charles Billaut ,  Stanisław Gawiejnowicz ,  Dario Pacciarelli
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   Softcover reprint of the original 1st ed. 2014
Dimensions:   Width: 15.50cm , Height: 1.50cm , Length: 23.50cm
Weight:   4.394kg
ISBN:  

9783662506356


ISBN 10:   3662506351
Pages:   271
Publication Date:   27 August 2016
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Reviews

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)


“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)


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List