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

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

Advertisements
Advertisements

प्रश्न

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 _______

रिकाम्या जागा भरा

उत्तर

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 A – D – B – C.

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

APPEARS IN

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

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

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

One of the assumptions made while sequencing n jobs on 2 machines is: two jobs must be loaded at a time on any machine.


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.


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 ______


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:

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

Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×