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.
KeywordsSchedule Problem Optimal Schedule Hamiltonian Path Priority Rule Short Processing Time
Unable to display preview. Download preview PDF.