2004 | OriginalPaper | Buchkapitel
Classification of Scheduling Problems
verfasst von : Professor Dr. Peter Brucker
Erschienen in: Scheduling Algorithms
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The theory of scheduling is characterized by a virtually unlimited number of problem types (see, e.g. Baker [11], Blazewicz et al. [24], Coffman [63], Conway et al. [66], French [86], Lenstra [144], Pinedo [172], Rinnooy Kan [173], Tanaev et al. [185], Tanaev et al. [186]). In this chapter, a basic classification for the scheduling problems covered in the first part of this book will be given. This classification is based on a classification scheme widely used in the literature (see, e.g. Lawler et al. [138]). In later chapters we will extend this classification scheme.