HSC Commerce: Marketing and Salesmanship इयत्ता १२ वी - Maharashtra State Board Important Questions

The time interval between starting the first job and completing the last job including the idle time (if any) in a particular order by the given set of machines 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 ______.

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.

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.

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:

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 ______

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

An unbalanced assignment problems can be balanced by adding dummy rows or columns with ______ cost

In sequencing problem the time which required to complete all the jobs i.e. entire task is called ______

The optimum sequence for the above data is ______

State whether the following statement is True or False:

In sequencing problem the processing times are dependent of order of processing the jobs on machine

Find the assignments of salesman to various district which will yield maximum profit

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.

For the following assignment problem minimize total man hours:

Subtract the `square` element of each `square` from every element of that `square`

Subtract the smallest element in each column from `square` of that column.

The lines covering all zeros is `square` to the order of matrix `square`

The assignment is made as follows:

Optimum solution is shown as follows:

A → `square, square` → III, C → `square, square` → IV

Minimum hours required is `square` hours

State whether the following statement is true or false:

To convert a maximization-type assignment problem into a minimization problem, the smallest element in the matrix is deducted from all elements of the matrix.

A job production unit has four jobs P, Q, R, and S which can be manufactured on each of the four machines I, II, III, and IV. The processing cost of each job for each machine is given in the following table:

Find the optimal assignment to minimize the total processing cost.

Five jobs are performed first on machine M₁ and then on machine M₂. Time taken in hours by each job on each machine is given below:

Determine the optimal sequence of jobs and total elapsed time. Also, find the idle time for two machines.

A department store has four workers to pack goods. The times (in minutes) required for each worker to complete the packings per item sold is given below. How should the manager of the store assign the jobs to the workers, so as to minimize the total time of packing?

A marketing manager has list of salesmen and territories. Considering the travelling cost of the salesmen and the nature of territory, the marketing manager estimates the total of cost per month (in thousand rupees) for each salesman in each territory. Suppose these amounts are as follows:

Find the assignment of salesman to territories that will result in minimum cost.

Six jobs are performed on Machines M₁ and M₂ respectively. Time in hours taken by each job on each machine is given below:

Determine the optimal sequence of jobs and find total elapsed time. Also find the idle time for machines M₁ and M₂.

Solution:

Given jobs can be arranged in optimal sequence as,

Total Elapsed time = `square` hrs.

Idle time for Machine M₁ = 43 – 42 = 1 hour.

Idle time for Machine M₂ = `square` hrs.

Three new machines M1, M2, M3 are to be installed in a machine shop. There are four vacant places A, B, C, D. Due to limited space, machine M2 can not be placed at B. The cost matrix (in hundred rupees) is as follows:

Determine the optimum assignment schedule and find the minimum cost.