Classification of Scheduling Problems

Abstract

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.