Advertisements
Advertisements
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 |
Concept: undefined >> undefined
Choose the correct alternative :
The objective of sequencing problem is
Concept: undefined >> undefined
Advertisements
If there are n jobs and m machines, then there will be_______ sequences of doing the jobs.
Concept: undefined >> undefined
Choose the correct alternative :
In solving 2 machine and n jobs sequencing problem, the following assumption is wrong
Concept: undefined >> undefined
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:
Concept: undefined >> undefined
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 _______.
Concept: undefined >> undefined
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 ______.
Concept: undefined >> undefined
One machine - one job is not an assumption in solving sequencing problems.
Concept: undefined >> undefined
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.
Concept: undefined >> undefined
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.
Concept: undefined >> undefined
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.
Concept: undefined >> undefined
State whether the following is True or False :
In a sequencing problem, a machine can process more than one job at a time.
Concept: undefined >> undefined
State whether the following is True or False :
The time involved in moving a job from one machine to another is negligibly small.
Concept: undefined >> undefined
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.
Concept: undefined >> undefined
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 |
Concept: undefined >> undefined
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.
Concept: undefined >> undefined
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.
Concept: undefined >> undefined
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 |
Concept: undefined >> undefined
Choose the correct alternative:
If x = 2am, y = 2am2, where m be the parameter, then `("d"y)/("d"x)` = ?
Concept: undefined >> undefined
If x = `"a"("t" - 1/"t")`, y = `"a"("t" + 1/"t")`, where t be the parameter, then `("d"y)/("d"x)` = ?
Concept: undefined >> undefined
