Optimal scheduling combinatorics
From the preface: In this book we present a line of research which during almost ten years has considered various scheduling problems within computer science from a general point of view. The problems led to a certain type of pure mathematical problem, which, as it turns out, may be solved explicitly. The different applications have resulted in six conference papers, six papers in research journals and three survey papers. In all reports the mathematics has certain common elements, a fact which establishes connections between the different applications. Full descriptions of the applications constitute Part II of this volume: Chapters 4 to 9. Part I describes scheduling in general, successively focusing upon the present research. Chapter 1 starts with a presentation of scheduling in full generality, and ends with an account of major concepts within computer science scheduling. Chapter 2 describes major scheduling alternatives in computer science as well as previous research in the area. Chapter 3 gives a unified description of the applications of Part II, focusing upon the common mathematics and its relationship to the scheduling problems. The emerging mathematical problems have not been studied by the mathematical research community. An additional purpose of Chapter 3 is to describe this new research area within the field of combinatorics.
scientific article; zbMATH DE number 5146499