Skip to main content

2019 | Buch

Handbook on Scheduling

From Theory to Practice

verfasst von: Prof. Dr. Jacek Blazewicz, Prof. Dr. Klaus H. Ecker, Prof. Dr. Erwin Pesch, Prof. Dr. Günter Schmidt, Prof. Malgorzata Sterna, Prof. Dr. Jan Weglarz

Verlag: Springer International Publishing

Buchreihe : International Handbooks on Information Systems

insite
SUCHEN

Über dieses Buch

This handbook provides a comprehensive introduction to the theory and applications of scheduling in advanced planning and computer systems. It addresses a broad audience including practitioners and researchers interested in scheduling, as well as graduate and advanced undergraduate students in the fields of computer science and computer engineering, operations research, industrial and real-time engineering, management science, business administration and information systems, and applied mathematics.

The book begins by providing an introduction to and basic concepts from discrete mathematics. Single and multiple processor systems are covered, with a focus on multiprocessor tasks and hard real-time systems. Flow shop and open shop scheduling, as well as scheduling in job shops, are explained in detail. Issues like limited processor availability, time-dependence, resource constraints and imprecise computations are dealt with in dedicated chapters. Special attention is given to online scheduling, constraint programming and disjunctive scheduling. The book also features applications and cases involving flexible manufacturing systems, computer integrated production scheduling and logistics. In particular it presents case studies on optimization procedures for the production of acrylic glass and of helicopter parts in a flexible manufacturing system, an efficient decision support system for airport gate scheduling, concrete delivery planning, and berth and quay crane allocation at seaports.

Inhaltsverzeichnis

Frontmatter
1. Introduction
Abstract
Scheduling problems can be understood in general as the problems of allocating resources over time to perform a set of tasks being parts of some processes, among which computational and manufacturing ones are most important. Tasks individually compete for resources which can be of a very different nature, e.g. manpower, money, processors (machines), energy, tools.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
2. Basics
Abstract
In this chapter we provide the reader with basic notions used throughout the book.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
3. Definition, Analysis and Classification of Scheduling Problems
Abstract
Throughout this book we are concerned with scheduling computer and manufacturing processes.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
4. Scheduling on One Processor
Abstract
Single machine scheduling (SMS) problems seem to have received substantial attention because of several reasons.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
5. Scheduling on Parallel Processors
Abstract
This chapter is devoted to the analysis of scheduling problems in a parallel processor environment.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
6. Communication Delays and Multiprocessor Tasks
Abstract
One of the assumptions imposed in Chapter 3 was that each task is processed on at most one processor at a time.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
7. Scheduling in Hard Real-Time Systems
Abstract
In Chapters 4 and 5 we analyzed scheduling problems in which the task performance is subject to temporal restrictions such as release times or deadlines.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
8. Flow Shop Scheduling
Abstract
Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of n jobs, each of which is characterized by the same machine sequence.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
9. Open Shop Scheduling
Abstract
The formulation of an open shop scheduling problem is the same as for the flow shop problem except that the order of processing tasks comprising one job may be arbitrary.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
10. Scheduling in Job Shops
Abstract
In this chapter we continue scheduling of tasks on dedicated processors or machines. We assume that tasks belong to a set of jobs, each of which is characterized by its own machine sequence.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
11. Scheduling with Limited Processor Availability
Abstract
In scheduling theory the basic model assumes that all machines are continuously available for processing throughout the planning horizon.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
12. Time-Dependent Scheduling
Abstract
In previous chapters we have always assumed that the processing times of tasks are fixed and described by numbers.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
13. Scheduling under Resource Constraints
Abstract
The scheduling model we consider now is more complicated than the previous ones, because any task, besides processors, may require for its processing some additional scarce resources.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
14. Scheduling Imprecise Computations
Abstract
The previous chapters focused on various scheduling models, such as single or parallel processors (Chapters 4, 5) and shop systems (Chapters 8, 9, 10), and presented results for different performance measures.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
15. Online Scheduling
Abstract
Online scheduling can be considered as scheduling with incomplete information, where the decisions on executing tasks have to be made without knowing the complete problem instance, and the input data is provided piece-by-piece.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
16. Constraint Programming and Disjunctive Scheduling
Abstract
Constraint propagation is an elementary method for reducing the search space of combinatorial search and optimization problems which has become more and more important in the last decades.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
17. Scheduling in Flexible Manufacturing Systems
Abstract
An important application area for machine scheduling theory comes from Flexible Manufacturing Systems (FMSs).
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
18. Computer Integrated Production Scheduling
Abstract
Within all activities of production management, production scheduling is a major part covering planning and control functions.
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
19. Scheduling in Logistics
Abstract
Logistic and transportation related problems are crucial for various human activities, since moving people, items,
Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna, Jan Weglarz
Backmatter
Metadaten
Titel
Handbook on Scheduling
verfasst von
Prof. Dr. Jacek Blazewicz
Prof. Dr. Klaus H. Ecker
Prof. Dr. Erwin Pesch
Prof. Dr. Günter Schmidt
Prof. Malgorzata Sterna
Prof. Dr. Jan Weglarz
Copyright-Jahr
2019
Electronic ISBN
978-3-319-99849-7
Print ISBN
978-3-319-99848-0
DOI
https://doi.org/10.1007/978-3-319-99849-7

Premium Partner