http://www.universalteacherpublications.com/univ/ebooks/or/Ch14/examp.

htm This problem refers to the following situation: Suppose n jobs are to be processed on two machines, say A & B. Each job has to pass through the same sequence of operations in the same order, i.e., passing is not allowed. After a job is completely processed on machine A, it is assigned to machine B. If machine B is not free at that moment, then the job enters the waiting queue. Each job from the waiting queue is assigned to machine B according to FIFO discipline. Let Ai = Processing time for ith job on machine A Bi = Processing time for ith job on machine B T = Total elapsed time The problem here is to determine the sequence in which these n jobs should be processed through A & B, so that the total elapsed time (T) is minimum. Steps: 1. Select the minimum processing time out of all the Ai's and Bi's. If it is Ar then do the rth job first. If it is Bs then do the sth job in last. 2. If there is a tie in selecting minimum of all the processing times, then there are following three ways to deal with such a situation: o If the minimum of all the processing times is Ar, which is also equal to Bs. That is, Min (Ai, Bi) = Ar = Bs Then do the rth job first and sth job in last. o If Min (Ai, Bi) = Ar, but Ar = Ak, i.e., there is a tie for minimum among Ai's, then select any one. o If Min (Ai, Bi) = Bs, but Bs = Bt, i.e., there is a tie for minimum among Bi's, then select any one. 3. Now eliminate the job which has already been assigned from further consideration, and repeat steps 1 and 2 until an optimal sequence is found. Example1: Suppose we have five jobs, each of which has to be processed on two machines A & B in the order AB. Processing times are given in the following table: Job Machine A Machine B 1 6 3 2 2 7 3 10 8 4 4 9 5 11 5

4. Determine an order in which these jobs should be processed so as to minimize the total processing time.

The minimum time in the above table is 2, which corresponds to job 2 on machine A. 2 Now we eliminate job 2 from further consideration. The reduced set of processing times are as follows: Job 1 3 4 5 Machine Machine A B 6 3 10 8 4 9 11 5

The minimum time is 3 for job 1 on machine B. Therefore, this job would be done in last. The allocation of jobs till this stage would be 2 1

After deletion of job 1, the reduced set of processing times are as follows: Job 3 4 5 Machine Machine A B 10 8 4 9 11 5

Similarly, by repeating the above steps, the optimal sequence is as follows: 2 4 3 5 1

Once the optimal sequence is obtained, the minimum elapsed time may be calculated as follows: Job 2 4 3 5 1 Machine A Time in Time out 0 2 2 6 6 16 16 27 27 33 Machine B Time in Time out 2 9 9 18 18 26 27 32 33 36

Idle time for machine A = total elapsed time - time when the last job is out of machine A 36 - 33 = 3 hours

Idle time for machine B = Time at which the first job in a sequence finishes on machine

A+ {( time when the ith job starts on machine B) - (time when the (i -1)th finishes on machine B)} Idle time for machine B = 2 + (9 - 9) + (18 - 18) + (27 - 26) + (33 - 32) = 4 hours