English

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

Advertisements
Advertisements

Question

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
Chart
Sum
Advertisements

Solution

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
  Is there an error in this question or solution?
Chapter 7: Assignment Problem and Sequencing - Part II [Page 129]

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

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.


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


Choose the correct alternative :

In solving 2 machine and n jobs sequencing problem, the following assumption is wrong


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 :

The time involved in moving a job from one machine to another is negligibly small.


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


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


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


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: 

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.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×