Advertisements
Advertisements
Question
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 |
Solution
| Job | A | B | C | D | E |
| Machine X | 10 | 2 | 18 | 6 | 20 |
| Machine Y | 4 | 12 | 14 | 16 | 8 |
Observe that Min(X, Y) = 2, corresponding to job B on machine X.
∴ Job B is placed first in sequence
| B |
Then the problem reduces to
| Job | A | C | D | E |
| Machine X | 10 | 18 | 6 | 20 |
| Machine Y | 4 | 14 | 16 | 8 |
Now, Min(X, Y) = 4, corresponds to job A on machine Y.
∴ Job A is placed last in sequence.
| B | A |
Then the problem reduces to
| Job | C | D | E |
| Machine X | 18 | 6 | 20 |
| Machine Y | 14 | 16 | 8 |
Now, Min(X, Y) = 6, corresponds to job D on machine X.
∴ Job D is placed second in sequence.
| B | D | A |
Then the problem reduces to
| Job | C | E |
| Machine X | 18 | 20 |
| Machine Y | 14 | 8 |
Now, Min(X, Y) = 8, corresponds to job E on machine Y.
∴ Job E is placed fourth and job C on remaining in sequence.
∴ The optimal sequence is
| B | D | C | E | A |
Total elapsed time,
| Job | Machine X | Machine Y | ||
| In | Out | In | Out | |
| B (2, 12) | 0 | 2 | 2 | 14 |
| D (6, 16) | 2 | 8 | 14 | 30 |
| C (18, 14) | 8 | 26 | 30 | 44 |
| E (20, 8) | 26 | 46 | 46 | 54 |
| A (10, 4) | 46 | 56 | 56 | 60 |
∴ Total elapsed time = 60 hrs.
Idle time for machine X = 60 – 56 = 4 hrs
Idle time for machine Y = 2 + 2 + 2 = 6 hrs.
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.
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 |
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
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 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.
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.
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 |
If there are n jobs and m machines, then there will be _______ sequence of doing jobs.
In assignment problem each worker or machine is ______ capable of handling any job
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:
In sequencing problem each job once started on any machine must be processed still its completion
