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

State whether the following is True or False : The time involved in moving a job from one machine to another is negligibly small.

Advertisements
Advertisements

प्रश्न

State whether the following is True or False :

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

पर्याय

  • True

  • False

MCQ
चूक किंवा बरोबर
Advertisements

उत्तर

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

shaalaa.com
Types of Sequencing Problem
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 7: Assignment Problem and Sequencing - Miscellaneous Exercise 7 [पृष्ठ १२८]

APPEARS IN

बालभारती Mathematics and Statistics 2 (Commerce) [English] Standard 12 Maharashtra State Board
पाठ 7 Assignment Problem and Sequencing
Miscellaneous Exercise 7 | Q 3.15 | पृष्ठ १२८

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

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

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

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


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 :

If there are two least processing times for machine A and machine B, priority is given for the processing time which has lowest time of the adjacent machine.


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 :

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


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.


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 ______


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:

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


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 ______


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×