Advertisements
Advertisements
प्रश्न
One machine - one job is not an assumption in solving sequencing problems.
पर्याय
True
False
Advertisements
उत्तर
This statement is False.
APPEARS IN
संबंधित प्रश्न
A machine operator has to perform two operations, turning and threading on 6 different jobs. The time required to perform these operations (in minutes) for each job is known. Determine the order in which the jobs should be processed in order to minimize the total time required to complete all the jobs. Also find the total processing time and idle times for turning and threading operations.
| Job | 1 | 2 | 3 | 4 | 5 | 6 |
| Time of turning | 3 | 12 | 5 | 2 | 9 | 11 |
| Time for threading | 8 | 10 | 9 | 6 | 3 | 1 |
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.
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 |
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 |
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:
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 :
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 :
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.
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.
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.
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
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
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
