Advertisements
Advertisements
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.
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 |
Find the total elapsed time and also find idle time for machine B.
Advertisements
Solution
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 |
Here min A = 12, max B = 12, min C = 8.
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
Type | 1 | 2 | 3 | 4 | 5 |
Machine G | 26 | 32 | 16 | 20 | 30 |
Machine H | 18 | 30 | 20 | 18 | 18 |
Observe that Min (G, H) = 16 corresponds to Type 3 on machine G.
∴ Type 3 is placed first in sequence.
3 | 2 | 5 | 4 | 1 |
Then the problem reduces to
Type | 1 | 2 | 4 | 5 |
Machine G | 26 | 32 | 20 | 30 |
Machine H | 18 | 30 | 18 | 18 |
Now, Min (G, H) = 18, which corresponds to Type 1, Type, 4 and Type 5 on machine H.
∴ Type 1, 4 and 5 are placed either last, second, and last or third last and Type remaining in the sequence.
3 | 2 | 5 | 4 | 1 |
OR |
3 | 2 | 5 | 1 | 4 |
OR |
3 | 2 | 1 | 4 | 5 |
OR |
3 | 2 | 1 | 5 | 4 |
OR |
3 | 2 | 4 | 1 | 5 |
OR |
3 | 2 | 4 | 5 | 1 |
We take the optimal sequence as,
3 – 2 – 5 – 4 – 1
Total elapsed time
Job | Machine A | Machine B | Machine C | |||
In | Out | In | Out | In | Out | |
3 (12, 4, 16) | 0 | 12 | 12 | 16 | 16 | 32 |
2 (20, 12, 18) | 12 | 32 | 32 | 44 | 44 | 62 |
5 (22, 8, 10) | 32 | 54 | 54 | 62 | 62 | 72 |
4 (14, 6, 12) | 54 | 68 | 68 | 74 | 74 | 86 |
1 (16, 10, 8) | 68 | 84 | 84 | 94 | 94 | 102 |
∴ Total elapsed time = 102 hrs
Idle time for machine A = 102 – 84 = 18 hrs
Idle time for machine B = (102 – 94) + 12 + 16 + 10 + 6 + 10 = 62 hrs
Idle time for machine C = 16 + 12 + 2 + 8 = 38 hrs.
Notes
Students can refer to the provided solution According to their question.
APPEARS IN
RELATED QUESTIONS
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.
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 | 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 :
The objective of sequencing problem is
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 _______.
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 _______
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
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:
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 |
The processing times required for four jobs A, B, C and D on machine M_{1} are 5, 8, 10 and 7 hours and on machine M_{2} it requires 7, 4, 3 and 6 hours respectively. The jobs are processed in the order M_{l}, M_{2}. 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.