Methods of solution

  • A. H. G. Rinnooy Kan


In this chapter we examine the better known methods that have been used to solve machine scheduling problems. They will be treated in more or less detail in inverse proportion to the degree to which they reappear in chapters 4, 5 and 6. The presentation in sections 3.1 to 3.5 and 3.7 thus varies between the description of a common framework and a definite review. Since the choice of an appropriate solution method depends to some extent on the complexity of the problem, we consider this latter aspect more formally in section 3.6.


Schedule Problem Optimal Schedule Hamiltonian Path Priority Rule Short Processing Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Martinus Nijhoff, The Hague 1976

Authors and Affiliations

  • A. H. G. Rinnooy Kan

There are no affiliations available

Personalised recommendations