Advertisements
Advertisements
Question
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 |
Advertisements
Solution
Observe that Min (A, B) = 5, corresponds to job VI on machine B and job VII on machine A.
∴ Job VI is placed last and job VII is placed first in sequence.
| VII | VI |
Then the problem reduces to
| Job | I | II | IIII | IV | V |
| Machine A | 7 | 16 | 19 | 10 | 14 |
| Machine B | 12 | 14 | 14 | 10 | 6 |
Now, Min (A, B) = 7, corresponds to job I on machine A.
∴ Job I is placed second in sequence.
| VII | I | VI |
Then the problem reduces to
| Job | II | III | IV | V |
| Machine A | 16 | 19 | 10 | 14 |
| Machine B | 14 | 14 | 10 | 16 |
Now, Min (A, B) = 10, corresponds to job IV on machine A as well as on machine B.
∴ Job IV is placed second last in sequence.
| VII | I | IV | VI |
OR
| VII | I | IV | VI |
Then the problem reduces to
| Job | II | III | V |
| Machine A | 16 | 19 | 14 |
| Machine B | 14 | 14 | 16 |
Now, Min (A, B) = 14, corresponds to job II and job III on machine B and job V on machine A.
∴ These three jobs can be placed in the sequence in order:
V – III – II or V – II – III
∴ The optimal sequence can be
| VII | I | IV | V | III | II | VI |
OR
| VII | I | V | III | II | IV | VI |
OR
| VII | I | IV | V | II | III | VI |
OR
| VII | I | V | II | III | IV | VI |
∴ We consider the optimal sequence as VII – I – IV – V – III – II – VI
Total Elapsed Time
| Job | Machine A | Machine B | ||
| In | Out | In | Out | |
| VII (5, 7) | 0 | 5 | 5 | 12 |
| I (7, 12) | 5 | 12 | 12 | 24 |
| IV (10, 10) | 12 | 22 | 24 | 34 |
| V (14, 16) | 22 | 36 | 36 | 52 |
| III (19, 14) | 36 | 55 | 55 | 69 |
| II (16, 14) | 55 | 71 | 71 | 85 |
| V (15, 5) | 71 | 86 | 86 | 91 |
∴ Total elapsed time = 91 units
Idle time for Machine A = 91 – 86
= 5 units
Idle time for Machine B = 5 + 2 + 3 + 2 + 1
= 13 units
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.
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.
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 ______.
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 :
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 :
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.
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:
The idle time for a machine is the when machine is available but is not waiting for any job to be processed
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.
