Advertisements
Advertisements
प्रश्न
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. Determine the order in which the jobs should be processed in order to minimize the total time required to complete all the jobs. Also find the total processing time and idle times for turning and threading operations.
Job | 1 | 2 | 3 | 4 | 5 | 6 |
Time of turning | 3 | 12 | 5 | 2 | 9 | 11 |
Time for threading | 8 | 10 | 9 | 6 | 3 | 1 |
उत्तर
Job | 1 | 2 | 3 | 4 | 5 | 6 |
Time of turning | 3 | 12 | 5 | 2 | 9 | 11 |
Time for threading | 8 | 10 | 9 | 6 | 3 | 1 |
Observe that Min (turning, threading) = 1, which corresponds to job 6 on threading machine.
Therefore, job 6 is placed last in sequence.
6 |
Then the problem reduces to
Job | 1 | 2 | 3 | 4 | 5 |
Time of turning | 3 | 12 | 5 | 2 | 9 |
Time for threading | 8 | 10 | 9 | 6 | 3 |
Now, Min (turning, threading) = 2, which corresponds to job 4 on turning machine
∴ Job 4 is placed first in sequence.
4 | 6 |
Then the problem reduces to
Job | 1 | 2 | 3 | 5 |
Time of turning | 3 | 12 | 5 | 9 |
Time for threading | 8 | 10 | 9 | 3 |
Now, Min (turning, threading) = 3, which corresponds to job 1 on turning and job 5 on threading.
∴ Job 1 is placed second and job 5 is placed second last.
4 | 1 | 5 | 6 |
Then the problem reduces to
Job | 2 | 3 |
Time of turning | 12 | 5 |
Time for threading | 10 | 9 |
Now, Min (turning, threading) = 5, which corresponds to job 3 on turning.
∴ Job 3 is placed third on sequence and job 2 on remaining.
∴ Optimal solution is
4 | 1 | 3 | 2 | 5 | 6 |
Total elapsed time
Job | Turning | Threading | ||
In | Out | In | Out | |
4(2, 6) | 0 | 2 | 2 | 8 |
1(3, 8) | 2 | 5 | 8 | 16 |
3(5, 9) | 5 | 10 | 16 | 25 |
2(12, 10) | 10 | 22 | 25 | 35 |
5(9, 3) | 22 | 31 | 35 | 38 |
6(11, 1) | 31 | 42 | 42 | 43 |
∴ Total elapsed time = 43 mins
Idle time for turning = 43 – 42 = 1 min
Idle time for threading = 2 + 4 = 6 mins.
APPEARS IN
संबंधित प्रश्न
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 |
Choose the correct alternative :
In a 3 machine and 5 jobs problem, the least of processing times on machine A, B and C are 5, 1 and 3 hours and the highest processing times are 9, 5 and 7 respectively, then it can be converted to a 2 machine problem if order of the machines is:
State whether the following is True or False :
One of the assumptions made while sequencing n jobs on 2 machines is: two jobs must be loaded at a time on any machine.
State whether the following is True or False :
In a sequencing problem, a machine can process more than one job at a time.
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 :
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.
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:
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.
Choose the correct alternative:
In solving 2 machine and n jobs sequencing problem, the following assumption is wrong
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:
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
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.