Advertisements
Advertisements
प्रश्न
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 |
उत्तर
Job | I | II | III | IV | V |
Lathe | 4 | 1 | 5 | 2 | 5 |
Surface grinder | 3 | 2 | 4 | 3 | 6 |
Observe that Min (lathe, grinder) = 1, corresponds to job II on lathe.
∴ Job II is placed first in sequence.
II |
Then the problem reduces to
Job | I | III | IV | V |
Lathe | 4 | 5 | 2 | 5 |
Surface grinder | 3 | 4 | 3 | 6 |
Now, Min (lathe, grinder) = 2, corresponds to job IV on lathe.
∴ Job IV is placed after II in sequence.
II | IV |
Then the problem reduces to
Job | I | III | V |
Lathe | 4 | 5 | 5 |
Surface grinder | 3 | 4 | 6 |
Now, Min (lathe, grinder) = 3, corresponds to job I on grinder.
∴ Job I is placed last in sequence.
II | IV | I |
Then the problem reduces to
Job | III | V |
Lathe | 5 | 5 |
Surface grinder | 4 | 6 |
Now, Min (lathe, grinder) = 4, corresponds to job III on grinder.
∴ Job III is placed before I and V on remaining in sequence.
∴ Optimal sequence is
II | IV | V | III | I |
Total elapsed time
Job | Lath | Surface Grinder |
||
In | Out | In | Out | |
II (1, 2) | 0 | 1 | 1 | 3 |
IV (2, 3) | 1 | 3 | 3 | 6 |
V (5, 6) | 3 | 8 | 8 | 14 |
III (5, 4) | 8 | 13 | 14 | 18 |
I (4, 3) | 13 | 17 | 18 | 21 |
∴ Total elapsed time = 21 hrs
Idle time for lathe = 21 – 17 = 4 hrs
Idle time for surface grinder = 1 + 2 = 3 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.
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
Choose the correct alternative :
In solving 2 machine and n jobs sequencing problem, the following assumption is wrong
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 _______.
One machine - one job is not an assumption in solving sequencing problems.
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 :
In a sequencing problem, a machine can process more than one job at a time.
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.
Solve the following problem :
A foreman wants to process 4 different jobs on three machines: a shaping machine, a drilling machine and a tapping machine, the sequence of operations being shaping-drilling-tapping. Decide the optimal sequence for the four jobs to minimize the total elapsed time. Also find the total elapsed time and the idle time for every machine.
Job | Shaping (Minutes) | Drilling (Minutes) | Trapping (Minutes) |
1 | 13 | 3 | 18 |
2 | 18 | 8 | 4 |
3 | 8 | 6 | 13 |
4 | 23 | 6 | 8 |
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:
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 job once started on any machine must be processed still its completion
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 |
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.