मराठी
महाराष्ट्र राज्य शिक्षण मंडळएचएससी वाणिज्य (इंग्रजी माध्यम) इयत्ता १२ वी

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.

Advertisements
Advertisements

प्रश्न

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
बेरीज
Advertisements

उत्तर

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
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 7: Assignment Problem and Sequencing - Exercise 7.2 [पृष्ठ १२५]

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

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.


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

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 solving 2 machine and n jobs sequencing problem, the following assumption is wrong


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


One machine - one job is not an assumption in solving sequencing problems.


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:

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.


In assignment problem each worker or machine is ______ capable of handling any job


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:

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


Find the sequence that minimizes total elapsed time to complete the following jobs in the order XY. Find the total elasped time and idle times for each machine.

Jobs A B C D E
Machine X 10 2 18 6 20
Machine Y 4 12 14 16 8

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×