ABSTRACT
This chapter deals with the techniques to find the right sequence that minimises the idle time of operations. S. M. Johnson suggested a sequencing rule for a situation where there is a group of n jobs to be processed through two successive work centers. The rule ensures minimum completion time for the group of n jobs by minimising the total idle times of the work centers. For sequencing and scheduling n jobs on three machines, Jackson proposed a simple rule by which the nX3 is converted to nX2 model for preparing the sequence. And then schedule may be prepared as usually for the three machines individually either by time chart or Gantt chart. Sequencing the jobs may not be always in the form of nX2 or nX3. In fact in real practice, one often comes across with the n jobs to sequence on m machines or men or work centers. However it is not very difficult to sequence in such case.
