1.040/1.401/ESD.018 Project Management. LECTURE 13 RESOURCE ALLOCATION PART 3 Integer Programming Analyzing Queues in Project Management. Sam Labi and Fred Moavenzadeh Massachusetts Institute of Technology. Queuing Systems I. Today’s conversation ….

Download Presentation

1.040/1.401/ESD.018 Project Management

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

1.040/1.401/ESD.018Project Management LECTURE 13 RESOURCE ALLOCATION PART 3 Integer Programming Analyzing Queues in Project Management Sam Labi and Fred Moavenzadeh Massachusetts Institute of Technology

Queuing Systems I Today’s conversation … Integer Programming as a Tool for Resource Allocation in Project Management - Activities only - Activities and Resources Queuing in Project Management - Examples of Queuing Systems - Components of a Queuing System - The Capacity of a Queue - Queuing System Performance - Attributes of a Queuing System

PART 1 Integer Programming for Resource Allocation in Project Management

Consider the Following Simple Project Activity Diagram (Activities Only) X3 X2 X1 X6 X4 X5 • Types of relationships • Complementary: Xi should be done with (before or after Xj) • Substitutionary: Either Xi must be done or Xj must be done. • Precedence: Xi must be done before Xj • Xi must be done after Xj) • 4. Mandatory: Xi must be done “no matter what”

Objective Function What is our goal? What are we seeking to maximize/minimize? Maximize the sum of all benefits E.g. The set of activities that involve the lowest total duration Minimize the sum of all costs E.g. The set of activities that involve the least resources Maximize all benefits and minimize all costs

Objective Function What is our goal? What are we seeking to maximize/minimize? Maximize the sum of all benefits E.g. The set of activities that involve the lowest total duration Minimize the sum of all costs E.g. The set of activities that involve the least resources Maximize all benefits and minimize all costs OBJ = B + (– C) Linear additive

Objective Function What is our goal? What are we seeking to maximize/minimize? Maximize the sum of all benefits E.g. The set of activities that involve the lowest total duration Minimize the sum of all costs E.g. The set of activities that involve the least resources Maximize all benefits and minimize all costs OBJ = B + (– C) Linear additive Linear additive, equal weight of 1 OBJ = 1B – 1C

Objective Function What is our goal? What are we seeking to maximize/minimize? Maximize the sum of all benefits E.g. The set of activities that involve the lowest total duration Minimize the sum of all costs E.g. The set of activities that involve the least resources Maximize all benefits and minimize all costs OBJ = B + (– C) Linear additive Linear additive, equal weight of 1 OBJ = 1B – 1C OBJ = wBB – wCC Linear additive, non-equal weights

Objective Function What is our goal? What are we seeking to maximize/minimize? Maximize the sum of all benefits E.g. The set of activities that involve the lowest total duration Minimize the sum of all costs E.g. The set of activities that involve the least resources Maximize all benefits and minimize all costs Linear additive OBJ = B + (– C) Linear additive, equal weight of 1 OBJ = 1B – 1C Linear additive, non-equal weights OBJ = wBB – wCC Linear multiplicative

EXTENSION OF THE PROBLEM TO RESOURCE ALLOCATION 1 2 3 4 5 J X2 X3 X2 X3 X1 X1 X6 X6 X4 X5 X4 X5 New formulations (Resource Allocation formulations): X represents an activity+resource bundle Previous formulations: X represents an activity

EXTENSION OF THE PROBLEM TO RESOURCE ALLOCATION 1 2 3 4 5 J Resources Xij is a Resource-activity pair Resource j is allocated to Activity i Activities: i = 1, 2, … I Resources: j = 1, 2, … J X23 means Resource 3 is allocated to Activity 2 X55 means Resource 5 is allocated to Activity 5 X23 X31 X15 X64 X44 X55 New formulations (Resource Allocation formulations): X represents an activity+resource bundle

EXTENSION OF THE PROBLEM TO RESOURCE ALLOCATION 1 2 3 4 5 J Resources What if more than one resource is allocated to an activity? Example, Resources 3 and 5 are allocated to Activity 5 Means that X55 and X53 should exist in the mathematical formulation. X23 X31 X15 X64 X55 X44 X53

X23 X31 X15 X64 X44 X55 Xij = 1,0 i = 1,2,…, Ij = 1,2,…, J

X31 X23 X15 X64 X44 X55 X15 = 1 Resource-Activity Pair 1-5 definitely needs to be carried out

X31 X23 X15 X64 X44 X55 X23 + X44 = 1 Carry out Resource-Activity Pairs 2-3 or 4-4 but not both.

X31 X23 X15 X64 X44 X55 The average benefit of all selected Resource-activity pair should be at least b*

X31 X23 X15 X64 X44 X55 The average cost of all selected Resource-activity pairs should not exceed c*

X31 X23 X15 X64 X44 X55 The least benefit of any selected Resource-activity pair should be b* OR No Resource-activity pair selected should have a benefit that is less than b*

X31 X23 X15 X64 X44 X55 The highest cost of any selected Resource-activity pair should be c* OR No Resource-activity pair selected should have a cost that is more than c*

Objective Function What is our goal? What are we seeking to maximize/minimize? Maximize the sum of all benefits E.g. The set of resource-activity pairs that involve the lowest total duration Minimize the sum of all costs E.g. The set of resource-activity pairs that involve the least resources Maximize all benefits and minimize all costs