Advertisements
Advertisements
प्रश्न
Solve the following problem :
Find the sequence that minimizes the total elapsed time to complete the following jobs. Each job is processed in order AB.
Machines | Jobs (Processing times in minutes) | ||||||
I | II | III | IV | V | VI | VII | |
Machine A | 12 | 6 | 5 | 11 | 5 | 7 | 6 |
Machine B | 7 | 8 | 9 | 4 | 7 | 8 | 3 |
Determine the sequence for the jobs so as to minimize the processing time. Find the total elapsed time and the idle times for both the machines.
उत्तर
Machines | Jobs (Processing times in minutes) | ||||||
I | II | III | IV | V | VI | VII | |
Machine A | 12 | 6 | 5 | 11 | 5 | 7 | 6 |
Machine B | 7 | 8 | 9 | 4 | 7 | 8 | 3 |
Observe that Min (A, B) = 3, corresponds to job VII on machine B.
∴ Job VII is placed last in sequence.
VII |
Then the problem reduces to
Machines | Jobs (Processing times in minutes) | |||||
I | II | III | IV | V | VI | |
Machine A | 12 | 6 | 5 | 11 | 5 | 7 |
Machine B | 7 | 8 | 9 | 4 | 7 | 8 |
Now, Min (A, B) = 4, corresponds to job IV on machine B
∴ Job IV is placed before VII in sequence.
IV | VII |
Then the problem reduces to
Machines | Jobs (Processing times in minutes) | ||||
I | II | III | V | VI | |
Machine A | 12 | 6 | 5 | 5 | 7 |
Machine B | 7 | 8 | 9 | 7 | 8 |
Now, Min (A, B) = 5, corresponds to job III and V on machine A.
∴ Job III and V is placed either first or second in sequence.
III | V | IV | VII |
OR |
V | III | IV | VII |
Then the problem reduces to
Machines | Jobs (Processing times in minutes) | ||
I | II | VI | |
Machine A | 12 | 6 | 7 |
Machine B | 7 | 8 | 8 |
Now, Min (A, B) = 6, corresponds to job II on machine A
∴ Job II is placed on third place in sequence.
III | V | II | IV | VII |
OR |
V | III | II | IV | VII |
Then the problem reduces to
Machines | Jobs (Processing times in minutes) | |
I | VI | |
Machine A | 12 | 7 |
Machine B | 7 | 8 |
Now, Min (A, B) = 7, corresponds to job I on machine B and VI on machine A.
∴ Job I is placed before IV and job VI on remaining in sequence.
III | V | II | VI | I | IV | VII |
OR |
V | III | II | VI | I | IV | VII |
We take the optimal sequence as,
III | V | II | VI | I | IV | VII |
Total elapsed time
Job | Machine A | Machine B | ||
In | Out | In | Out | |
III (5, 9) | 0 | 5 | 5 | 14 |
V (5, 7) | 5 | 10 | 14 | 21 |
II (6, 8) | 10 | 16 | 21 | 29 |
VI (7, 8) | 16 | 23 | 29 | 37 |
I (12, 7) | 23 | 35 | 37 | 44 |
IV (11, 4) | 35 | 46 | 46 | 50 |
VII (6, 3) | 46 | 52 | 52 | 55 |
∴ Total elapsed time = 55 mins
Idle time for machine A = 55 – 52 = 3 mins
Idle time for machine B = 5 + 2 + 2 = 9 mins.
APPEARS IN
संबंधित प्रश्न
An insurance company receives three types of policy application bundles daily from its head office for data entry and tiling. The time (in minutes) required for each type for these two operations is given in the following table:
Policy | 1 | 2 | 3 |
Data Entry | 90 | 120 | 180 |
Filing | 140 | 110 | 100 |
Find the sequence that minimizes the total time required to complete the entire task.
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 the total elapsed time. Also find the total elapsed time and idle time for each machine.
Job | A | B | C | D | E |
Machine X | 10 | 2 | 18 | 6 | 20 |
Machine Y | 4 | 12 | 14 | 16 | 8 |
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 the machines.
Job | I | II | IIII | IV | V | VI | VII |
Machine A | 7 | 16 | 19 | 10 | 14 | 15 | 5 |
Machine B | 12 | 14 | 14 | 10 | 16 | 5 | 7 |
Find the optimal sequence that minimizes total time required to complete the following jobs in the order ABC. The processing times are given in hours.
Jobs | I | II | III | IV | V | VI | VII |
Machine A | 6 | 7 | 5 | 11 | 6 | 7 | 12 |
Machine B | 4 | 3 | 2 | 5 | 1 | 5 | 3 |
Machine C | 3 | 8 | 7 | 4 | 9 | 8 | 7 |
Choose the correct alternative :
The objective of sequencing problem is
If there are n jobs and m machines, then there will be_______ sequences of doing the jobs.
Fill in the blank :
The time for which a machine j does not have a job to process to the start of job is called _______.
Fill in the blank :
The time required for printing of four books A, B, C and D is 5, 8, 10 and 7 hours while its data entry requires 7, 4, 3 and 6 hrs respectively. The sequence that minimizes total elapsed time is _______
One machine - one job is not an assumption in solving sequencing problems.
State whether the following is True or False :
If there are two least processing times for machine A and machine B, priority is given for the processing time which has lowest time of the adjacent machine.
State whether the following is True or False :
The time involved in moving a job from one machine to another is negligibly small.
Solve the following problem :
Five jobs must pass through a lathe and a surface grinder, in that order. The processing times in hours are shown below. Determine the optimal sequence of the jobs. Also find the idle time of each machine.
Job | I | II | III | IV | V |
Lathe | 4 | 1 | 5 | 2 | 5 |
Surface grinder | 3 | 2 | 4 | 3 | 6 |
A toy manufacturing company produces five types of toys. Each toy has to go through three machines A, B, C in the order ABC. The time required in hours for each process is given in the following table.
Type | 1 | 2 | 3 | 4 | 5 |
Machine A | 16 | 20 | 12 | 14 | 22 |
Machine B | 10 | 12 | 4 | 6 | 8 |
Machine C | 8 | 18 | 16 | 12 | 10 |
Solve the problem for minimizing the total elapsed time.
Choose the correct alternative:
Machine | Job | |||
A | B | C | D | |
I | 5 | 6 | 8 | 4 |
II | 4 | 7 | 9 | 10 |
The optimal sequence for above data is
Choose the correct alternative:
If there are 3 machines A, B and C, conditions for reducing a 3 machine problem to a 2 machine problem with respect to minimum processing time is ______
If there are n jobs and m machines, then there will be _______ sequence of doing jobs.
In sequencing problem the time required to transfer a job from one machine to another is ______
State whether the following statement is True or False:
The Total Elapsed is the time required to complete all the jobs i.e. entire task
State whether the following statement is True or False:
In sequencing problem each job once started on any machine must be processed still its completion
State whether the following statement is True or False:
In sequencing problem each machine is of different type
A publisher produces 5 books on Mathematics. The books have to go through composing, printing and binding done by 3 machines A, B, C. The time schedule for the entire task in proper unit is as follows :
Book | I | II | III | IV | V |
Machine A | 4 | 9 | 8 | 6 | 5 |
Machine B | 5 | 6 | 2 | 3 | 4 |
Machine C | 8 | 10 | 6 | 7 | 11 |
Determine the optimum time required to finish the entire task. Also, find idle time for machines A, B, C.