Related QuestionsVIEW ALL [10]
The manager of a company wants to find a measure which he can use to fix the monthly wages of persons applying for a job in the production department. As an experimental project, he collected data of 7 persons from that department referring to years of service and their monthly income :
| Years of service | 11 | 7 | 9 | 5 | 8 | 6 | 10 |
| Income (` in thousands) | 10 | 8 | 6 | 5 | 9 | 7 | 11 |
Find regression equation of income on the years of service.
Find the sequence of the following five jobs to be processed on three machines M1 M2, , M3 that will minimize the total elapsed time to complete the tasks . Each job is to be processed in the order M1 - M2 - M3 :
| Jobs | 1 | 2 | 3 | 4 | 5 |
| Machine M1 | 5 | 11 | 5 | 7 | 6 |
| Machine M2 | 1 | 4 | 2 | 5 | 3 |
| Machine M3 | 1 | 5 | 2 | 3 | 4 |
Find the sequence that minimizes the total elapsed time required to complete the following task. The table below gives the processing time in hours. Also, find the minimum elapsed time and idle times for both machines.
| Jobs | 1 | 2 | 3 | 4 | 5 |
| M1 | 3 | 7 | 4 | 5 | 7 |
| M2 | 6 | 2 | 7 | 3 | 4 |
For the following problem find the sequence that minimizes total elapsed time (in hrs) required to complete the jobs on 2 machines M1 and M2 in the order M1 - M2 · Also find the minimum elapsed time T.
| Job | A | B | C | D | E | F |
| M1 | 4 | 8 | 3 | 6 | 7 | 5 |
| M2 | 6 | 3 | 7 | 2 | 8 | 4 |
We have seven jobs each of which has to go through two machines M1 and M2 in the order M1 - M2 . Processing times (in hours) are given as :
| Jobs | A | B | C | D | E | F | G |
| Machine M1 | 3 | 12 | 15 | 6 | 10 | 11 | 9 |
| Machine M2 | 8 | 10 | 10 | 6 | 12 | 1 | 3 |
Determine a sequence of these jobs that Will minimize the total elapsed time 'T', and idle time for each machine .
For the following problem, find the sequence that minimize total elapsed time (in hours) required to complete the following jobs on two machines M1 and M2 in the order M1 - M2:
| Jobs | A | B | C | D | E |
| Machine M1 | 5 | 1 | 9 | 3 | 10 |
| Machine M2 | 2 | 6 | 7 | 8 | 4 |
A company produces mixers and food processor. Profit on selling one mixer and one food processor is Rs 2,000 and Rs 3,000 respectively. Both the products are processed through three machines A, B, C. The time required in hours for each product and total time available in hours per week on each machine arc as follows:
| Machine | Mixer | Food Processor | Available time |
| A | 3 | 3 | 36 |
| B | 5 | 2 | 50 |
| C | 2 | 6 | 60 |
Formulate the problem as L.P.P. in order to maximize the profit.
The time (in hours) required to perform the printing and binding operations (in that order) for each book is given in the following table :
| Books | I | II | III | IV | V |
| Printing Machine M1 | 3 | 7 | 4 | 5 | 7 |
|
Binding Machine M2 |
6 | 2 | 7 | 3 | 4 |
Find the sequence that minimizes the total elapsed time (in hours) to complete the work .
