In the previous chapter, you studied the mechanics of obtaining an optimal replacement policy for machines. This chapter concentrates on the problem of determining the sequence (order) in which a number of jobs should be performed on different machines in order to make effective use of available facilities and achieve greater output.
For example, consider a sequencing problem where n jobs are to be performed on m different machines. In such a case, our problem is to determine the sequence, which minimizes the total elapsed time. Here, the term elapsed time means the time from the start of first job upto the completion of the last job.
In this chapter, we discuss the following cases:
Few general assumptions in this chapter are as follows: