P. 1
Send

Send

|Views: 2|Likes:
Published by sharadggg

More info:

Published by: sharadggg on Apr 20, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less

12/21/2013

pdf

text

original

Example 1 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 1 2 3 4 5 Machine Machine A B 6 3 2 7 10 8 4 9 11 5

Determine an order in which these jobs should be processed so as to minimize the total processing time. "The time is the most valuable thing." -Vinay Chhabra & Manish Dewan Solution. 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 Machine Machine A B 6 3 10 8

(time when the (i -1)th finishes on machine B)} Idle time for machine B = 2 + (9 .18) + (27 .time when the last job is out of machine A 36 . by repeating the above steps.9) + (18 .26) + (33 . 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 .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) .4 5 4 11 9 5 The minimum time is 3 for job 1 on machine B. Therefore. the optimal sequence is as follows: 2 4 3 5 1 Once the optimal sequence is obtained. 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.32) = 4 hours .

one binding machine. The allocation of jobs till this stage is: B A The reduced set of processing times are as follows: .Example 2 Strong Book Binder has one printing machine. which corresponds to the book B on printing machine. The reduced set of processing times are as follows: Book A C D E Time In Hours Printing Binding 5 2 9 7 3 8 10 4 The minimum time is 2 for book A on binding machine. Processing times are given in the following table: Book A B C D E Time In Hours Printing Binding 5 2 1 6 9 7 3 8 10 4 We wish to determine the order in which books should be processed on the machines. Therefore. B Now book B is eliminated. Solution. The minimum time in the above table is 1. and the manuscripts of a number of different books. in order to minimize the total time required. this job should be done in last.

22) + (28 .28 = 2 hours Idle time for binding process = 1 + (7 .15) + (23 .Book C D E Time In Hours Printing Binding 9 7 3 8 10 4 Similarly.27) = 3 hours .7) + (15 .time when the last job is out of machine A 30 . the minimum elapsed time may be calculated as follows: Book B D C E A Printing Time in Time out 0 1 1 4 4 13 13 23 23 28 Binding Time in Time out 1 7 7 15 15 22 23 27 28 30 Idle time for printing process = total elapsed time . the optimal sequence is as follows: B D C E A Once the optimal sequence is obtained. by repeating the above steps.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->