Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
| 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 |
Observe that Min (A, B) = 3, corresponds to job VII on machine B.
∴ Job VII is placed last in sequence.
| VII |
Then the problem reduces to
| Machines | Jobs (Processing times in minutes) | |||||
| I | II | III | IV | V | VI | |
| Machine A | 12 | 6 | 5 | 11 | 5 | 7 |
| Machine B | 7 | 8 | 9 | 4 | 7 | 8 |
Now, Min (A, B) = 4, corresponds to job IV on machine B
∴ Job IV is placed before VII in sequence.
| IV | VII |
Then the problem reduces to
| Machines | Jobs (Processing times in minutes) | ||||
| I | II | III | V | VI | |
| Machine A | 12 | 6 | 5 | 5 | 7 |
| Machine B | 7 | 8 | 9 | 7 | 8 |
Now, Min (A, B) = 5, corresponds to job III and V on machine A.
∴ Job III and V is placed either first or second in sequence.
| III | V | IV | VII |
| OR |
| V | III | IV | VII |
Then the problem reduces to
| Machines | Jobs (Processing times in minutes) | ||
| I | II | VI | |
| Machine A | 12 | 6 | 7 |
| Machine B | 7 | 8 | 8 |
Now, Min (A, B) = 6, corresponds to job II on machine A
∴ Job II is placed on third place in sequence.
| III | V | II | IV | VII |
| OR |
| V | III | II | IV | VII |
Then the problem reduces to
| Machines | Jobs (Processing times in minutes) | |
| I | VI | |
| Machine A | 12 | 7 |
| Machine B | 7 | 8 |
Now, Min (A, B) = 7, corresponds to job I on machine B and VI on machine A.
∴ Job I is placed before IV and job VI on remaining in sequence.
| III | V | II | VI | I | IV | VII |
| OR |
| V | III | II | VI | I | IV | VII |
We take the optimal sequence as,
| III | V | II | VI | I | IV | VII |
Total elapsed time
| Job | Machine A | Machine B | ||
| In | Out | In | Out | |
| III (5, 9) | 0 | 5 | 5 | 14 |
| V (5, 7) | 5 | 10 | 14 | 21 |
| II (6, 8) | 10 | 16 | 21 | 29 |
| VI (7, 8) | 16 | 23 | 29 | 37 |
| I (12, 7) | 23 | 35 | 37 | 44 |
| IV (11, 4) | 35 | 46 | 46 | 50 |
| VII (6, 3) | 46 | 52 | 52 | 55 |
∴ Total elapsed time = 55 mins
Idle time for machine A = 55 – 52 = 3 mins
Idle time for machine B = 5 + 2 + 2 = 9 mins.
APPEARS IN
संबंधित प्रश्न
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.
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.
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 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 _______.
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 :
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 |
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
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 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 |
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 ______
