English

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

Advertisements
Advertisements

Question

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

Options

  • True

  • False

MCQ
True or False

Solution

False

shaalaa.com
Types of Sequencing Problem
  Is there an error in this question or solution?
Chapter 2.7: Assignment Problem and Sequencing - Q.3

APPEARS IN

SCERT Maharashtra Mathematics and Statistics (Commerce) [English] 12 Standard HSC
Chapter 2.7 Assignment Problem and Sequencing
Q.3 | Q 9

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

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 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, a machine can process more than one job at a time.


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 :

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

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.


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


If there are n jobs and m machines, then there will be _______ sequence of doing jobs.


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


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×