O P E R AT I O N R E S E A R C H P R O J E C T

D E L E G AT I N G T H E W O R K

AMONG

THE TEAM MEMBERS

P R E PA R E D B Y:
ALO K SINHA (ROLL NO: EPGP-03-095)

N I T I N J A I S WA L ( R O L L N O : E P G P- 0 3 - 1 3 9 )

NITESH KUMA R (R OLL NO : EPGP-0 3 - 13 8)

S H A R O N S E LV A R A J ( R O L L N O : E P G P - 0 3 - 1 6 7 )

SREERAMANA GADHAMSETTY (ROLL NO: EMEP-10-064)

YESHASWINI GR (ROLL NO: EPGP-03-193)

 Operational Research Project

TABLE OF CONTENTS

1. PROBLEM DEFINITION .........................................................................................................3

2. PROBLEM SOLUTION ...........................................................................................................4
3. DECISION VARIABLE DEFINITION .........................................................................................4
4. OBJECTIVE FUNCTION DEFINITION ......................................................................................5
A) AVERAGE NUMBER OF BUGS ....................................................................................................5
B) EXPENDITURE ON BONUS ........................................................................................................5
5. CONSTRAINT DEFINITION ....................................................................................................5
A) NUMBER OF MODULES TO BE CODED ..........................................................................................6
B) MINIMUM LINES OF CODE .......................................................................................................6
C) MAXIMUM LINES OF CODE ......................................................................................................6
6. SOLUTION ............................................................................................................................7
A) SOLVING FOR THE MINIMUM BUGS.............................................................................................7
B) SOLVING FOR THE MINIMUM EXPENDITURE ..................................................................................8
7. SUMMARY OF MODEL .........................................................................................................9
 Operational Research Project

1. Problem Definition
Bangalore Hardware division is a small group of 10 people operating from Bangalore for
a big company ABC Inc. This group, headed by Mr. Chetan, is dedicated group of size ten
engineers. The profile of the group is as follows:

Si. Exp
No. Name (Years)
Chetan
1 (Manager) 20
1 Person 1 3
2 Person 2 10
3 Person 3 9
4 Person 4 7
5 Person 5 6
6 Person 6 10
7 Person 7 2
8 Person 8 9
9 Person 9 5
10 Person 10 6

This group has been delivering quality product over the past few years. Seeing the
team’s capability and performance, higher management has given the group a challenge
of a big project which will be approximately require 200 modules each approximately
1000 lines of code to be developed next. Management has asked Mr. Chetan to submit
a report on the project, project schedule and also include the two important points:

1. Expected minimum number of Bugs in the first release of project before the testing
period.

2. Minimum budget allocated for the distribution of the bonuses at the end of the
project.

Over the past project delivery Mr. Chetan knows the following data:

1. Average bugs per thousand line of code per person = 20

2. Number of bugs per thousand line of code reduced per year of experience by 2

3. Amount of bonus given to respective employees per module coded per year of
experience is 1 thousand
 Operational Research Project
4. Mr. Chetan also knows that to maintain the quality of the work maximum number of
lines of code allotted per person should not exceed 50000 and to maintain the
proper integrity of the team members minimum number of lines allotted per should
be minimum 5000

2. Problem Solution
Mr. Chetan has decided to use the integer programming for generating the above
two data for the above requested report from the higher management. Based on
the above situation he is able to make the following points:

1. Big project of approximate 200 modules

2. Each module is having the average number of lines = 1000

3. Team size = 10

4. Minimum number of lines of code per head = 5000

5. Maximum number of line of code per head = 50000

6. Average bugs per thousand line of code per person = 20

7. Number of bugs per thousand line of code reduced per year of experience by 2
and the minimum average bug is five

8. Find out Number of modules allocated to each member

9. Amount of bonus given to respective employees per module per year of

experience is 1 thousand

3. Decision Variable Definition

Based on the case, the decision variables formed are

X 1 : number of modules given of Person 1

X2 : number of modules given of Person 2

X 3 : number of modules given of Person 3

X 4 : number of modules given of Person 4

X 5 : number of modules given of Person 5

 Operational Research Project
X 6 : number of modules given of Person 6

X 7 : number of modules given of Person 7

X 8 : number of modules given of Person 8

X 9 : number of modules given of Person 9

X 10 : number of modules given of Person 10

4. Objective Function Definition

a) Average Number of Bugs

As per the above data, average number of bugs before the testing is minimum of 5
or average bugs – 2*number of years of experience

Total number of bugs = X1*14 + X2*5 + X3*5 + X4*6 + X5*8 + X6*5 + X7*16 + X8*5 +
X9*10 + X10*8

Mr. Chetan would require minimizing the total number of bugs by re-distributing the
modules among the members of the group.

b) Expenditure on Bonus
As per the above figures the amount of bonus to be given per person is equal to
number of modules he codes * number of year of experience * 1

Expenditure on Bonus amount(thousand)

= X1*(3) + X2*(10) + X3*(9) + X4*(7) + X5*(6) + X6*(10) + X7*(2) + X8*(9) + X9*(5) +

X10*(6)

= X1*3 + X2*10 + X3*9 + X4*7 + X5*6 + X6*10 + X7*2 + X8*9 + X9*5 + X10*6

Mr. Chetan would require minimizing the total expenditure on bonus by re-
distributing the modules among the members of the group.

5. Constraint Definition
Based on the above constraints the constraints are as follows:
 Operational Research Project

a) Number of modules to be coded

Total number of modules to be coded = 200

X1 + X2 + X3 + X4 + X5 + X6 + X7 + X8 + X9 + X10 = 200

b) Minimum Lines of code

Minimum number of lines to be coded by each individual is 5000. And we also know
that average number of lines code per module is 1000.

i) X1 >= 5

ii) X2 >= 5

iii) X3 >= 5

iv) X4 >= 5

v) X5 >= 5

vi) X6 >= 5

vii) X7 >= 5

viii) X8 >= 5

ix) X9 >= 5

x) X10 >= 5

c) Maximum Lines of Code

Maximum number of lines to be coded each individual to maintain the quality is
50000. So number of max modules is 50, based on this
 Operational Research Project
i) X1 <= 50

ii) X2 <= 50

iii) X3 <= 50

iv) X4 <= 50

v) X5 <= 50

vi) X6 <= 50

vii) X7 <= 50

viii) X8 <= 50

ix) X9 <= 50

x) X10 <= 50

6. Solution

a) Solving for the minimum bugs

Solving the above problem for the minimum bug’s requirement gives the final
answer as follows
 Operational Research Project
i) X1 = 5

ii) X2 = 50

iii) X3 = 50

iv) X4 = 5

v) X5 = 5

vi) X6 = 50

vii) X7 = 5

viii) X8 = 20

ix) X9 = 5

x) X10 = 5

And the total expected number of bugs with the above distribution of the bugs is
1160.

With the above distribution the budget required for the bonuses is 1182 thousand.

b) Solving for the minimum expenditure

Solving the above problem for the minimum expenditure requirement gives the final
answer as follows
 Operational Research Project
i) X1 = 50

ii) X2 = 5

iii) X3 = 5

iv) X4 = 5

v) X5 = 5

vi) X6 = 5

vii) X7 = 50

viii) X8 = 5

ix) X9 = 50

x) X10 = 20

And the total amount required for the bonus is 887 thousand.

With the above distribution, the expected number of bugs is 1325.

7. Summary of Model
Based on the above approach Mr. Chetan has suggested two solutions to the higher
management:

Solution 1 : With this approach, expected number of bugs before the testing is
minimized to 1160, but the amount needed for the bonus is 1182 thousand.

Solution 2 : With this approach, amount needed for the b onus is minimized to 887
thousand, but the expected number of bugs will be 1325.