Optimal scheduling combinatorics

MaRDI QIDQ878329zbMATH OpenFDO

Authors Håkan Lennerstad, Lars Lundberg

Publication date 26 April 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/journal/15710653

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35)

Review text

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.

Recommendations

• Approximating schedules
• scientific article; zbMATH DE number 2114378
• Scheduling algorithms
• scientific article; zbMATH DE number 1167865
• Handbook on Scheduling

Cited in

(18)

• Combinatorial optimization techniques for spacecraft scheduling automation
• Optimal randomized scheduling by replacement
• Optimal scheduling of slots with season segmentation
• The maximum gain of increasing the number of preemptions in multiprocessor scheduling
• Scheduling personal finances via integer programming
• scientific article; zbMATH DE number 3908140 (Why is no real title available?)
• scientific article; zbMATH DE number 4029243 (Why is no real title available?)
• scientific article; zbMATH DE number 724323 (Why is no real title available?)
• Scheduling Conflict-Free Parties for a Dating Service
• scientific article; zbMATH DE number 1946760 (Why is no real title available?)
• scientific article; zbMATH DE number 2148765 (Why is no real title available?)
• scientific article; zbMATH DE number 1852165 (Why is no real title available?)
• scientific article; zbMATH DE number 863504 (Why is no real title available?)
• Optimal scheduling of products with common and unique components
• A combinatorial problem in a multitask information server
• Combinatorial optimization in real-time scheduling: Theory and algorithms
• Fast combination of scheduling chains under resource and time constraints
• Scheduling problems

This page was built for publication: Optimal scheduling combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878329)