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 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
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:
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 :
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 :
One of the assumptions made while sequencing n jobs on 2 machines is: two jobs must be loaded at a time on any machine.
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 |
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
If there are n jobs and m machines, then there will be _______ sequence of doing jobs.
______ time is the time when the machine is available but is waiting for a job to be processed
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:
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 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
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 |
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.