Scribd
Upload
289 views6 pages

L3-Resource Allocation Problem

The document discusses the resource allocation problem involving m resources and n projects, aiming to maximize total profit based on given profit values for resource allocation. It describes the problem using a multistage graph approach and provides an example of finding the longest path to determine optimal resource distribution. Additionally, an assignment is presented to find the best allocation of 4 resources across 3 projects to maximize benefits.

Uploaded by

cse21216
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
289 views6 pages

L3-Resource Allocation Problem

The document discusses the resource allocation problem involving m resources and n projects, aiming to maximize total profit based on given profit values for resource allocation. It describes the problem using a multistage graph approach and provides an example of finding the longest path to determine optimal resource distribution. Additionally, an assignment is presented to find the best allocation of 4 resources across 3 projects to maximize benefits.

Uploaded by

cse21216
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Resource Allocation Problem

Faculty: Dr Sansar S Chauhan


Resource Allocation Problem

Faculty: Dr Sansar S Chauhan


The resource allocation
problem
m resources, n projects
profit p(i, j) : j resources are allocated to
project i.
maximize the total profit.
Resource
Project 1 2 3
1 2 8 9
2 5 6 7
3 4 4 4
4 2 4 5

Faculty: Dr Sansar S Chauhan


A B C D E F G H I J K L
0 2 8 9 0 5 6,7,8 7,8,13 0 4,5 4,9,8 4, 9,
12,13

T 5 9 11 P1 13 P2 P3 P4
A E I
0,1 0 0,2 0 0,3
5 4
0 \
B 7 6 F 4 4 J 5
2 1,1 0 1,2 0 1,3 4
5 4
S 8 C
6
G
4
K 2
T
2,1 0 2,2 0 2,3
9 0
5 4
D H L
3,1 0 3,2 0 3,3

• The resource allocation problem can be described as a multistage graph.


• (i, j) : i resources allocated to projects 1, 2, …, j
e.g. node H=(3, 2) : 3 resources allocated to projects 1, 2.

The multistage graph solution


Faculty: Dr Sansar S Chauhan
Find the longest path from S to T :
(S, C, H, L, T), 8+5+0+0=13
2 resources allocated to project 1.
1 resource allocated to project 2.
0 resource allocated to projects 3, 4.

Faculty: Dr Sansar S Chauhan


Assignment:
Given
4 Resources
3 Project
Benefit of allocating specific number of resource to a project is given
below.
Project/Resources 0 1 2 3 4
1 0 6 8 8 10
2 0 5 11 16 17
3 0 1 4 5 6
Find the resource allocation to projects to maximize the
benefit.

Faculty: Dr Sansar S Chauhan

You might also like