Question 1

Question 1: A machine operator has to perform two operations, turning and threading on 6 different jobs. The time required to perform these operations (in minutes) for each job is known. Deter

Accepted Answer

Let turning to be A and threading be B. ∴ Observe Min{A, B} = 1 for job 6 on B. Then the problem reduces to ∴ Now Min {A, B} = 2 for job 4 on A Then the problem reduce to Now Min {A, B} = 3 for job 1 on A and job 5 on B Then the problem reduces to Now Min {A, B) = 5 for job 3 on A Only job 2 is left

Question 2

Question 2: A company has three jobs on hand, Each of these must be processed through two departments, in the AB where Department A: Press shop and Department B: Finishing The table below give

Accepted Answer

Observe Min {A, B} = 3 for job II on B. Then the problem is reduced to Now Min {A, B} = 4 for job III at B Now only job I in left ∴ the optimal sequence is given by The work table is Total elapsed time = 23 days Idle time for A = 23 – 19 = 4 days Idle time for B = 8 days

Question 3

Question 3: An insurance company receives three types of policy application bundles daily from its head office for data entry and filing. The time (in minutes) required for each type for these

Accepted Answer

Let Data entry be A and filing be B. So Observe min {A, B} = 90 for policy 1 at A Then the problem reduces to Observe min {A, B} = 100 for policy 3 at B Now only policy 2 is left ∴ The optimal sequence is Worktable So Total elapsed time = 490 min Idle time for A (data entry) = 490 – 390 = 100 min Id

Question 4

Question 4: There are five jobs, each of which must go through two machines in the order XY. Processing times (in hours) are given below. Determine the sequence for the jobs that will minimize

Accepted Answer

Observe min {x, y} = 2 for job B on x The problem reduces to Now min [x, y] = 4 for job A on x The problem reduces to Now min [x, y] = 6 for job D on x The problem reduces to Now min [x, y] = 8 for job E on y Now only job C in left ∴ The optimal sequence is Worktable Total elapsed time = 60 hrs Idle

Question 5

Question 5: Find the sequence that minimizes the total elapsed time to complete the following jobs in the order AB. Find the total elapsed time and idle times for both machines.

Accepted Answer

Observe min {A, B} = 5 for job VI for B and job VII for A The problem reduces to Now min {A, B] = 7 for job I on A The problem reduces to Now min {A, B] = 10 for job IV on A and B so we have two options. Or we take the 1st one. The problem reduces to Now min {A, B} = 14 for job V on A and job II and

Question 6

Question 6: Find the optimal sequence that minimizes the total time required to complete the following jobs in the order ABC. The processing times are given in hrs.

Accepted Answer

(i) Min A = 5, Max B = 5 As min A ≥ max B. The problem can be converted into two machine problems. Let G and H be two fictitious machines such that G = A + B and H = B + C we get Now min {G, H} = 7 for job III & V for G and job I for H ∴ We have two options Or We take the first one The problem r

Question 7

Question 7: A publisher produces 5 books on Mathematics. The books have to go through composing, printing, and binding was done by 3 machines P, Q, E. The time schedule for the entire task in

Accepted Answer

Min R = 6, Max Q = 6 As min R ≥ max Q. The problem can be converted into a two-machine problem. Let G and H be two fictitious machines such that G = P + Q and H = Q + R we get Min {G, H} = 9 for books A, D, E for G. ∴ We have more than one option we take The problem reduces to Min {G, H} = 8 for boo

Chapter 7 Assignment Problem and Sequencing Ex 7.2 Solutions