Abstract
As announced in chapter 1, this chapter deals with various aspects of problem formulation. In section 2.1 we discuss problem representations, including the important disjunctive graph model, and introduce notations to designate several concepts involving jobs, machines and operations. Whatever the interpretation of such concepts may be, several conditions have to be fulfilled before scheduling theory and algorithms can be applied; such restrictive assumptions are examined in section 2.2. The choice of optimality criteria will be discussed in section 2.3. Finally, in section 2.4 we combine previous notations to arrive at a classification of scheduling problems that determines to a large extent the structure of later chapters.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1976 Martinus Nijhoff, The Hague
About this chapter
Cite this chapter
Kan, A.H.G.R. (1976). Problem formulation. In: Machine Scheduling Problems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-4383-7_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-4383-7_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-90-247-1848-1
Online ISBN: 978-1-4613-4383-7
eBook Packages: Springer Book Archive