Advertisements
Advertisements
प्रश्न
Choose the correct alternative :
In solving 2 machine and n jobs sequencing problem, the following assumption is wrong
पर्याय
No passing is allowed
Processing times are known
Handling time is negligible
The time of passing depends on the order of machining
Advertisements
उत्तर
In solving 2 machine and n jobs sequencing problem, the following assumption is wrong The time of passing depends on the order of machining.
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.
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 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 |
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 _______.
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 :
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 :
The time involved in moving a job from one machine to another is negligibly small.
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 |
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
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:
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
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.
