English

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

Advertisements
Advertisements

Question

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 ______

Options

  • Min Ai ≥ Max Bi OR Min Ci ≥ Max Bi, i = 1, 2, 3…n

  • Min Ai ≤ Max Bi OR Min C ≤ Max Bi, i = 1, 2, 3…n

  • Max Ai ≥ Min Bi OR Max B ≥ Min Ai, i = 1, 2, 3…n

  • Max Ai ≤ Min Bi OR Max B ≤ Min Ai, i = 1, 2, 3…n

MCQ
Fill in the Blanks

Solution

Min Ai ≥ Max Bi OR Min Ci ≥ Max Bi, i = 1, 2, 3…n

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

RELATED QUESTIONS

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

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


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 :

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 :

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


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.


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.


Solve the following problem :

A foreman wants to process 4 different jobs on three machines: a shaping machine, a drilling machine and a tapping machine, the sequence of operations being shaping-drilling-tapping. Decide the optimal sequence for the four jobs to minimize the total elapsed time. Also find the total elapsed time and the idle time for every machine.

Job Shaping (Minutes) Drilling (Minutes) Trapping (Minutes)
1 13 3 18
2 18 8 4
3 8 6 13
4 23 6 8

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.


Choose the correct alternative:

In solving 2 machine and n jobs sequencing problem, the following assumption is wrong


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: 

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


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×
Our website is made possible by ad-free subscriptions or displaying online advertisements to our visitors.
If you don't like ads you can support us by buying an ad-free subscription or please consider supporting us by disabling your ad blocker. Thank you.