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
संबंधित प्रश्न
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 | III | 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 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 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 ______.
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.
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.
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
______ 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:
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.
