Name: Multiagent Scheduling: Models and Algorithms (en Inglés)
SKU: 62114858
Price: 104.91 USD
Availability: InStock
Author: Alessandro Agnetis; Jean-Charles Billaut; Stanisław Gawiejnowicz; Dario Pacciarelli; Ameur Soukhal

portada Multiagent Scheduling: Models and Algorithms (en Inglés)

Multiagent Scheduling: Models and Algorithms (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

Alessandro Agnetis; Jean-Charles Billaut; Stanisław Gawiejnowicz; Dario Pacciarelli; Ameur Soukhal

Idioma

Inglés

N° páginas

284

Encuadernación

Tapa Dura

ISBN13

9783642418792

N° edición

2014th

Multiagent Scheduling: Models and Algorithms (en Inglés)

Alessandro Agnetis; Jean-Charles Billaut; Stanisław Gawiejnowicz; Dario Pacciarelli; Ameur Soukhal (Autor) · Springer · Tapa Dura

Libro Nuevo Importado

Envío: 16 a 23 días háb.

$ 190.74$ 104.91

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 104.91

Llega entre el 17 Sep y el 30 Sep a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Multiagent Scheduling: Models and Algorithms (en Inglés)"

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.