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.