Multiagent Scheduling - Models and Algorithms (Paperback, Softcover reprint of the original 1st ed. 2014)

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.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Release date:	September 2016
First published:	2014
Authors:	Alessandro Agnetis • Jean-Charles Billaut • Stanislaw Gawiejnowicz • Dario Pacciarelli • Ameur Soukhal
Dimensions:	235 x 155 x 15mm (L x W x T)
Format:	Paperback
Pages:	271
Edition:	Softcover reprint of the original 1st ed. 2014
ISBN-13:	978-3-662-50635-6
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General Books > Business & Economics > Business & management > Management & management techniques > Operational research Promotions
LSN:	3-662-50635-1
Barcode:	9783662506356

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!