Or lein an initial feasible solution to the following Transportation Problem using the matrix minima method. D1 D2 D3 D4 Supply 01 2 3 4 02 4 3 8 03 Co 2 10 Demand 4 6. 8. 6. 24 (a) In a factory, there are six jobs to perform, each of which should go through two machines A and B in the order A, B. The processing timings (in hours) for the jobs are given here. You are required to determine the sequence for performing the jobs that would minimize the total elapsed time T. What is the value of T? 19. Job J1 J2 J3 J4 J5 J6 Machine A 8. 3 Machine B 6. 2 10 Or (b) Solve the game whose pay-off matrix is given by Player B B1 B2 B3 A1 (1 3. Player A A2 -4 -3 АЗ -1 (a) Consider the following project whose activities along with PERT time estimates, the optimistic time, most likely time and the pessimistic time and given as follows: 20. Activity Optimistic time Most likely time Pessimistic time S.No. 8211 4

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter6: Optimization Models With Integer Variables
Section6.5: Set-covering And Location-assignment Models
Problem 29P
icon
Related questions
Question
Or
Obtain an initial feasible solution to the following Transportation Problem
using the matrix minima method.
D1 D2 D3 D4 Supply
01
1
3
4
6.
02
4
3
2
8
03 Co
10
Demand
4
6.
8
6.
24
(a) In a factory, there are six jobs to perform, each of which should go through
two machines A and B in the order A, B. The processing timings (in hours) for
the jobs are given here. You are required to determine the sequence for
performing the jobs that would minimize the total elapsed time T. What is the
value of T?
19.
Job
J1 J2 J3 J4 J5 J6
Machine A
3
8.
3
Machine B
3
2
10
Or
(b) Solve the game whose pay-off matrix is given by
Player B
B1 B2 ВЗ
A1
3.
1
Player A
A2
-4
-3
АЗ
1
5
-1
(a) Consider the following project whose activities along with PERT time
estimates, the optimistic time, most likely time and the pessimistic time and
given as follows:
Activity Optimistic time Most likely time Pessimistic time
20.
S.No. 8211
4.
Transcribed Image Text:Or Obtain an initial feasible solution to the following Transportation Problem using the matrix minima method. D1 D2 D3 D4 Supply 01 1 3 4 6. 02 4 3 2 8 03 Co 10 Demand 4 6. 8 6. 24 (a) In a factory, there are six jobs to perform, each of which should go through two machines A and B in the order A, B. The processing timings (in hours) for the jobs are given here. You are required to determine the sequence for performing the jobs that would minimize the total elapsed time T. What is the value of T? 19. Job J1 J2 J3 J4 J5 J6 Machine A 3 8. 3 Machine B 3 2 10 Or (b) Solve the game whose pay-off matrix is given by Player B B1 B2 ВЗ A1 3. 1 Player A A2 -4 -3 АЗ 1 5 -1 (a) Consider the following project whose activities along with PERT time estimates, the optimistic time, most likely time and the pessimistic time and given as follows: Activity Optimistic time Most likely time Pessimistic time 20. S.No. 8211 4.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,