English

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

Advertisements
Advertisements

Question

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 IIII IV V VI VII
Machine A 7 16 19 10 14 15 5
Machine B 12 14 14 10 16 5 7
Sum

Solution

Observe that Min (A, B) = 5, corresponds to job VI on machine B and job VII on machine A.

∴ Job VI is placed last and job VII is placed first in sequence.

VII           VI

Then the problem reduces to

Job I II IIII IV V
Machine A 7 16 19 10 14
Machine B 12 14 14 10 6

Now, Min (A, B) = 7, corresponds to job I on machine A.

∴ Job I is placed second in sequence.

VII I         VI

Then the problem reduces to

Job II III IV V
Machine A 16 19 10 14
Machine B 14 14 10 16

Now, Min (A, B) = 10, corresponds to job IV on machine A as well as on machine B.

∴ Job IV is placed second last in sequence.

VII I IV       VI

             OR

VII I       IV VI

Then the problem reduces to

Job II III V
Machine A 16 19 14
Machine B 14 14 16

Now, Min (A, B) = 14, corresponds to job II and job III on machine B and job V on machine A.

∴ These three jobs can be placed in the sequence in order:

 V – III – II or V – II – III

∴ The optimal sequence can be

VII I IV V III II VI

              OR

VII I V III II IV VI

              OR

VII I IV V II III VI

              OR

VII I V II III IV VI

∴ We consider the optimal sequence as VII – I – IV – V – III – II – VI

Total Elapsed Time

Job Machine A Machine B
In Out In Out
VII (5, 7) 0 5 5 12
I (7, 12) 5 12 12 24
 IV (10, 10) 12 22 24 34
V (14, 16) 22 36 36 52
III (19, 14) 36 55 55 69
II (16, 14) 55 71 71 85
V (15, 5) 71 86 86 91

∴ Total elapsed time = 91 units

Idle time for Machine A = 91 – 86

= 5 units

Idle time for Machine B = 5 + 2 + 3 + 2 + 1

= 13 units.

shaalaa.com
Types of Sequencing Problem
  Is there an error in this question or solution?
Chapter 7: Assignment Problem and Sequencing - Exercise 7.2 [Page 125]

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.


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


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


Fill in the blank :

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 _______


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 :

In a sequencing problem, a machine can process more than one job at a time.


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

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:

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:

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


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: 

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


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.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×