Advertisements
Advertisements
प्रश्न
Solve the following problem :
A readymade garments manufacturer has to process 7 items through two stages of production, namely cutting and sewing. The time taken in hours for each of these items in different stages are given below:
Items | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
Time for Cutting | 5 | 7 | 3 | 4 | 6 | 7 | 12 |
Time for Sewing | 2 | 6 | 7 | 5 | 9 | 5 | 8 |
Find the sequence in which these items are to be processed through these stages so as to minimize the total processing time. Also find the idle time of each machine.
उत्तर
Items | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
Time for Cutting | 5 | 7 | 3 | 4 | 6 | 7 | 12 |
Time for Sewing | 2 | 6 | 7 | 5 | 9 | 5 | 8 |
Observe that Min (cutting, sewing) = 2, corresponds to item 1 on sewing.
∴ Item 1 is placed last in sequence.
1 |
Then the problem reduces to
Items | 2 | 3 | 4 | 5 | 6 | 7 |
Time for Cutting | 7 | 3 | 4 | 6 | 7 | 12 |
Time for Sewing | 6 | 7 | 5 | 9 | 5 | 8 |
Now, Min (cutting, sewing) = 3, corresponds to item 3 on cutting.
∴ Item 3 is placed first in sequence.
3 | 1 |
Then the problem reduces to
Items | 2 | 4 | 5 | 6 | 7 |
Time for Cutting | 7 | 4 | 6 | 7 | 12 |
Time for Sewing | 6 | 5 | 9 | 5 | 8 |
Now, Min (cutting, sewing) = 4, corresponds to item 4 on cutting.
∴ Item 4 is placed after 3 in sequence.
3 | 4 | 1 |
Item 4 is placed after 3 in sequence.
Items | 2 | 5 | 6 | 7 |
Time for Cutting | 7 | 6 | 7 | 12 |
Time for Sewing | 6 | 9 | 5 | 8 |
Now, Min (cutting, sewing) = 5, corresponds to item 6 on sewing
∴ Item 6 is placed before 1 in sequence.
3 | 4 | 6 | 1 |
Then the problem reduces to
Items | 2 | 5 | 7 |
Time for Cutting | 7 | 6 | 12 |
Time for Sewing | 6 | 9 | 8 |
Now, Min (cutting, sewing) = 6, corresponds to item 2 on sewing and item 5 on cutting.
∴ Item 2 is placed before 6 and item 5 is placed after 4 and item 7 on remaining in sequence.
∴ Optimal sequence is
3 | 4 | 5 | 7 | 2 | 6 | 1 |
Total elapsed time
Item | Cutting | Sewing | ||
In | Out | In | Out | |
3 (3, 7) | 0 | 3 | 3 | 10 |
4 (4, 5) | 3 | 7 | 10 | 15 |
5 (6, 9) | 7 | 13 | 15 | 24 |
7 (12, 8) | 13 | 25 | 25 | 33 |
2 (7, 6) | 25 | 32 | 33 | 39 |
6 (7, 5) | 32 | 39 | 39 | 44 |
1 (5, 2) | 39 | 44 | 44 | 46 |
∴ Total elapsed time = 46 hrs
Idle time for cutting = 46 44 = 2 hrs
Idle time for sewing = 3 + 1 = 4 hrs.
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.
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 :
In solving 2 machine and n jobs sequencing problem, the following assumption is wrong
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 _______
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 :
In a sequencing problem, the processing times are dependent of order of processing the jobs on machines.
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 |
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.
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.
In assignment problem each worker or machine is ______ capable of handling any job
______ time is the time when the machine is available but is waiting for a job to be processed
State whether the following statement is True or False:
One of the assumptions is made while sequencing n jobs on 2 machines is: two jobs must be loaded at a time on any machine
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:
The idle time for a machine is the when machine is available but is not waiting for any job to be processed
State whether the following statement is True or False:
In sequencing problem each machine is of different type
Find the sequence that minimizes total elapsed time to complete the following jobs in the order XY. Find the total elasped time and idle times for each machine.
Jobs | A | B | C | D | E |
Machine X | 10 | 2 | 18 | 6 | 20 |
Machine Y | 4 | 12 | 14 | 16 | 8 |
The processing times required for four jobs A, B, C and D on machine M1 are 5, 8, 10 and 7 hours and on machine M2 it requires 7, 4, 3 and 6 hours respectively. The jobs are processed in the order Ml, M2. The sequence that minimises total elapsed time is ______