हिंदी

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. Als - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

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
सारिणी
योग
Advertisements

उत्तर

Job I II III IV V
Lathe 4 1 5 2 5
Surface grinder 3 2 4 3 6

Observe that Min (lathe, grinder) = 1, corresponds to job II on lathe.

∴ Job II is placed first in sequence.

II        

Then the problem reduces to

Job I III IV V
Lathe 4 5 2 5
Surface grinder 3 4 3 6

Now, Min (lathe, grinder) = 2, corresponds to job IV on lathe.

∴ Job IV is placed after II in sequence.

II IV      

Then the problem reduces to

Job I III V
Lathe 4 5 5
Surface grinder 3 4 6

Now, Min (lathe, grinder) = 3, corresponds to job I on grinder.

∴ Job I is placed last in sequence.

II IV     I

Then the problem reduces to

Job III V
Lathe 5 5
Surface grinder 4 6

Now, Min (lathe, grinder) = 4, corresponds to job III on grinder.

∴ Job III is placed before I and V on remaining in sequence.

∴ Optimal sequence is

II IV V III I

Total elapsed time

Job Lath Surface
Grinder
In Out In Out
II (1, 2) 0 1 1 3
IV (2, 3) 1 3 3 6
V (5, 6) 3 8 8 14
III (5, 4) 8 13 14 18
I (4, 3) 13 17 18 21

∴ Total elapsed time = 21 hrs

Idle time for lathe = 21 – 17 = 4 hrs

Idle time for surface grinder = 1 + 2 = 3 hrs.

shaalaa.com
Types of Sequencing Problem
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 7: Assignment Problem and Sequencing - Part II [पृष्ठ १२९]

संबंधित प्रश्न

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

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


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 :

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.


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.


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.


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 ______


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


______ time is the time when the machine is available but is waiting for a job to be processed


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 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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×