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