Advertisements
Advertisements
Question
Choose the correct alternative:
In solving 2 machine and n jobs sequencing problem, the following assumption is wrong
Options
No passing is allowed
Processing times are known
Handling time is negligible
The time of passing depends on the order of machining
Solution
The time of passing depends on the order of machining
APPEARS IN
RELATED QUESTIONS
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 |
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
One machine - one job is not an assumption in solving sequencing problems.
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.
Solve the following problem :
A readymade garments manufacturer has to process 7 items through two stages of production, namely cutting and sewing. The time taken in hours for each of these items in different stages are given below:
Items | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
Time for Cutting | 5 | 7 | 3 | 4 | 6 | 7 | 12 |
Time for Sewing | 2 | 6 | 7 | 5 | 9 | 5 | 8 |
Find the sequence in which these items are to be processed through these stages so as to minimize the total processing time. Also find the idle time of each machine.
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:
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
______ 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:
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 machine is of different type
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.