Sequence Model

Sequence model determine the 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 up to the completion of the last job. Different cases of sequence problems are:
q q q

Processing n jobs through two machines. Processing n jobs through three machines. Processing two jobs through m machines.
8/2/12 1 1

Assumptions in Sequence Model

q

The processing time on each machine is known. The time required to complete a job is independent of the order of the jobs in which they are to be processed. No machine may process more than one job simultaneously. The time taken by each job in changing over from one machine to another is negligible. Each job, once started on a machine is to be performed up to completion on that machine. The order of completion of job has no significance, i.e., no 2 job is to be given 8/2/12 priority.
2

Processing n Jobs Through Two Machines Example: A book binder has one printing machine, one binding machine, and the manuscripts of a number of books. Processing times (in hours) are given in the following table:

Book A B C D E

Printing 5 1 9 3 10

Binding 2 6 7 8 4

Determine an order in which these books should be processed so as to minimize the total time required.
8/2/12 3 3

Solution. The minimum time in the above table is 1, which corresponds to Book B on printing.

Now we eliminate Book B. The reduced set of processing times Book printing Binding are:

A C D E

5 9 3 10

2 7 8 4

The minimum time is 2 for Book A on binding machine. Therefore, B A 8/2/12 4 this job should be done in last. The allocation of jobs till this
4

The reduced set of processing times are as follows:

Book C D E

Printing 9 3 10

Binding 7 8 4

Similarly, by repeating the above steps, the optimal sequence is as B D C E A follows: Once the optimal sequence is obtained, the minimum elapsed time may be calculated as follows: Book Printing Binding

Time in Time Time in Time out out B D 0 1 8/2/12 1 4 1 7 7 15

5 5

Book

printing

Binding

Time in Time Time in Time out out A B C 0 1 4 1 4 13 1 7 15 7 15 22

Idle time for printing process = total elapsed time - time D 23 27 when the last job 13out of Printing 23 is E= 30 - 28 = 2 hours 23 28 28 30 Idle time for binding process = 1 + (7 - 7) + (15 - 15) + (23 - 22) + (28 - 27) = 3 hours

8/2/12

6 6

8/2/12

7 7

8/2/12

8 8