HSC Commerce: Marketing and Salesmanship 12th Standard Board Exam - Maharashtra State Board Question Bank Solutions

Solve the following problem :

Find x if the cost of living index number is 193 for the following data.

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.

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

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.

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:

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.

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.

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.

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

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

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.

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:

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.