Central Library

Normal view MARC view ISBD view

Multiagent Scheduling [electronic resource] : Models and Algorithms / by Alessandro Agnetis, Jean-Charles Billaut, Stanis�aw Gawiejnowicz, Dario Pacciarelli, Ameur Soukhal.

By: Agnetis, Alessandro [author.].
Contributor(s): Billaut, Jean-Charles [author.] | Gawiejnowicz, Stanis�aw [author.] | Pacciarelli, Dario [author.] | Soukhal, Ameur [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookPublisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2014Description: XIII, 271 p. 55 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642418808.Subject(s): Business | Operations research | Decision making | Computers | Business and Management | Operation Research/Decision Theory | Models and PrinciplesAdditional physical formats: Printed edition:: No titleDDC classification: 658.40301 Online resources: Click here to access online
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.
In: Springer eBooksSummary: 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.  .
    average rating: 0.0 (0 votes)
No physical items for this record

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.

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.  .

There are no comments for this item.

Log in to your account to post a comment.