Advertisements
Advertisements
प्रश्न
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 |
Find the appropriate regression equation and use it to estimate the blood pressure of a woman with age 47 years. Find the optimal sequence that minimizes total time required to complete the following jobs in order A-B-C. The processing times are given in hrs.
| Job | 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 |
Advertisements
उत्तर
| Job | 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 |
Here min A = 5, max B = 5, min C = 3
Since min A ≥ max B is satisfied, the problem can be converted into a two machine problem.
Let G and H be two fictitious machines such that G = A + B and H = B + C
Then the problem can be written as
| Job | I | II | III | IV | V | VI | VII |
| Machine G | 10 | 10 | 7 | 16 | 7 | 12 | 15 |
| Machine H | 7 | 11 | 9 | 9 | 10 | 13 | 10 |
Observe that Min (G, H) = 7, corresponds to job I on machine H, job III on machine G and job V on machine G.
∴ Job I is placed last in sequence, Job III and V are placed either first or second in sequence.
| V | III | I |
| OR |
| III | V | I |
Then the problem reduces to
| Job | II | IV | VI | VII |
| Machine G | 10 | 16 | 12 | 15 |
| Machine H | 11 | 9 | 13 | 10 |
Now, Min (G, H) = 9, corresponds to Job IV on machine H.
∴ Job IV is placed second last in the sequence.
| V | III | IV | I |
| OR |
| III | V | IV | I |
Then the problem reduces to
| Job | II | VI | VII |
| Machine G | 10 | 12 | 15 |
| Machine H | 11 | 13 | 10 |
Now, Min (G, H) = 10, corresponds to Job II on machine G and Job VII on machine H.
∴ Job II is placed third in the sequence, Job VII is placed third last in the sequence and remaining Job VI is placed fourth in the sequence.
| V | III | II | VI | VII | IV | I |
| OR |
| III | V | II | VI | VII | IV | I |
∴ We consider the optimal sequence as V – III – II – VI – VII – IV – I
Total elapsed time
| Job | Machine A |
Machine B |
Machine C |
|||
| In | Out | In | Out | In | Out | |
| V (6, 1, 9) | 0 | 6 | 6 | 7 | 7 | 16 |
| III (5, 2, 7) | 6 | 11 | 11 | 13 | 16 | 23 |
| II (7, 3, 8) | 11 | 18 | 18 | 21 | 23 | 31 |
| VI (7, 5, 8) | 18 | 25 | 25 | 30 | 31 | 39 |
| VII (12, 3, 7) | 25 | 37 | 37 | 40 | 40 | 47 |
| IV (11, 5, 4) | 37 | 48 | 48 | 53 | 53 | 57 |
| I (6, 4, 3) | 48 | 54 | 54 | 58 | 58 | 61 |
Total elapsed time = 61 hrs
Idle time for Machine A = 61 – 54 = 7 hrs
Idle time for Machine B = (61 – 58) + 6 + 4 + 5 + 4 + 7 + 8 + 1 = 38 hrs
Idle time for Machine C = 7 + 1 + 6 + 1 = 15 hrs.
APPEARS IN
संबंधित प्रश्न
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 |
A company has three jobs on hand. Each of these must be processed through two departments, in the order AB where
Department A: Press shop and
Department B: Finishing
The table below gives the number of days required by each job in each department
| Job | I | II | III |
| Department A | 8 | 6 | 5 |
| Department B | 8 | 3 | 4 |
Find the sequence in which the three jobs should be processed so as to take minimum time to finish all the three jobs. Also find idle time for both the departments.
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.
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 _______.
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 :
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.
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:
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
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 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
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 ______
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.
