Advertisements
Advertisements
Solve the following problem :
Following tables shows the wheat yield (‘000 tonnes) in India for years 1959 to 1968.
| Year | 1959 | 1960 | 1961 | 1962 | 1963 | 1964 | 1965 | 1966 | 1967 | 1968 |
| Yield | 0 | 1 | 2 | 3 | 1 | 0 | 4 | 1 | 2 | 10 |
Fit a trend line to the above data by the method of least squares.
Concept: undefined >> undefined
Base year weights (W) and current year price relatives (I) are given in Problem. Calculate the cost of living index in:
| Group | Food | Clothing | Fuel & Lighting | House Rent | Miscellaneous |
| I | 70 | 90 | 100 | 60 | 80 |
| W | 5 | 3 | 2 | 4 | 6 |
Concept: undefined >> undefined
Advertisements
Base year weights (W) and current year price relatives (I) are given in Problem. Calculate the cost of living index in:
| Group | Food | Clothing | Fuel & Lighting | House Rent | Miscellaneous |
| I | 400 | 300 | 150 | 120 | 100 |
| W | 3 | 3 | 4 | 5 | 2 |
Concept: undefined >> undefined
Base year weights (W) and current year price relatives (I) are given in Problem. Calculate the cost of living index in:
| Group | Food | Clothing | Fuel & Lighting | House Rent | Miscellaneous |
| I | 200 | 150 | 120 | 180 | 160 |
| W | 30 | 20 | 10 | 40 | 50 |
Concept: undefined >> undefined
Find x if the cost of living index is 150.
| Group | Food | Clothing | Fuel & Lighting | House Rent | Miscellaneous |
| I | 180 | 120 | 300 | 100 | 160 |
| W | 4 | 5 | 6 | x | 3 |
Concept: undefined >> undefined
Base year weights (W) and current year price relatives (I) are given in Problem. Calculate the cost of living index in:
Find y if the cost of living index is 200.
| Group | Food | Clothing | Fuel & Lighting | House Rent | Miscellaneous |
| I | 180 | 120 | 160 | 300 | 200 |
| W | 4 | 5 | 3 | y | 2 |
Concept: undefined >> undefined
Solve the following problem :
Find the cost living index number by the Weighted Aggregate Method.
| Group | Food | Clothing | Fuel & Lighting | House Rent | Miscellaneous |
| I | 78 | 80 | 110 | 60 | 90 |
| W | 5 | 3 | 4 | 2 | 6 |
Concept: undefined >> undefined
Solve the following problem :
Find the cost of living index number by Family Budget Method for the following data. Also, find the expenditure of a person in the year 2008 if his expenditure in the year 2005 was ₹ 10,000.
| Group | Base Year (2005) Price |
Current Year (2008) Price |
Weight |
| Food | 12 | 60 | 25 |
| Clothing | 10 | 45 | 20 |
| Fuel and Lighting | 20 | 35 | 15 |
| House Rent | 25 | 20 | 30 |
| Miscellaneous | 16 | 48 | 10 |
Concept: undefined >> undefined
Solve the following problem :
Find x if the cost of living index number is 193 for the following data.
| Group | Food | Clothing | Fuel & Lighting | House Rent | Miscellaneous |
| I | 221 | 198 | 171 | 183 | 161 |
| W | 35 | 14 | x | 8 | 20 |
Concept: undefined >> undefined
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 |
Concept: undefined >> undefined
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
| Job | I | II | III |
| Department A | 8 | 6 | 5 |
| Department B | 8 | 3 | 4 |
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.
Concept: undefined >> undefined
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.
Concept: undefined >> undefined
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 |
Concept: undefined >> undefined
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 |
Concept: undefined >> undefined
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 |
Concept: undefined >> undefined
Choose the correct alternative :
The objective of sequencing problem is
Concept: undefined >> undefined
If there are n jobs and m machines, then there will be_______ sequences of doing the jobs.
Concept: undefined >> undefined
Choose the correct alternative :
In solving 2 machine and n jobs sequencing problem, the following assumption is wrong
Concept: undefined >> undefined
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:
Concept: undefined >> undefined
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 _______.
Concept: undefined >> undefined
