Optimization Techniques

Case Study (WeeMow Lawn Service )

GROUP : 07

PRESENTED TO: PRESENTED BY:

Dr. Salman Habib Adil Bashir 2020-IM-11
Muhammad Umer 2020-IM-16
Ali Asjad Abbasi 2020-IM-32
 Case Study Statement
• WeeMow Lawn Service provides lawn service, including mowing lawns and
lawn care, landscaping, and lawn maintenance, to residential and commercial
customers in the Draper town community. In the summer WeeMow has three
teams that it schedules daily for jobs.
• Team 1 has five members, team 2 has four members, and team 3 has three
members. On a normal summer day WeeMow will have approximately 14
jobs. Each team works 10 hours a day, but because of the heat plus work
breaks, each team actually works only 45 minutes out of every hour.
• The following table shows the times (in minutes) and costs (in dollars)
required for each team to complete the 14 jobs for a specific day.
• The WeeMow manager wants to develop a schedule ofteam
assignments to the jobs for this day. Formulate and solve a linear
programming model to determine the assignments of teams to jobs
that will minimize total job time for the day, given a daily budget of
$1,000.
• Indicate how many minutes each crew will work during the day. Next,
reformulate and solve this model if cost minimization is the objective.
Of these two models.
Objective Function:
a) Time Minimization
b) Cost Minimization

• Decision Variables:
• Xij = team i (i = 1, 2, 3) assigned to job j (where j = A, B, ..., N)
• Xij = 1 if job j assigned to team i.
• Xij = 0 if job j not assigned to team i.
 Time Minimization:
Objective Function:

Z = 45X1A + 67X1B + 90X1C + 61X1D + 75X1E +

48X1F + 65X1G + 67X1H + 95X1I + 60X1J +
47X1K + 114X1L + 85X1M + 63X1N + 65X2A +
72X2B + 105X2C + 78X2D + 93X2E + 70X2F +
83X2G + 84X2H + 110X2I + 78X2J + 64X2K +
135X2L + 107X2M + 81X2N + 78X3A + 85X3B +
125X3C + 97X3D + 107X3E + 95X3F + 110X3G +
100X3H + 130X3I + 95X3J + 84X3K + 155X3L +
125X3M + 102X3N
 Cost Minimization:
Objective Function:

Z = 48X1A + 70X1B + 94X1C + 65X1D +

80X1E + 55X1F + 70X1G + 72X1H + 100X1I
+ 65X1J + 55X1K + 118X1L + 90X1M +
67X1N + 55X2A + 60X2B + 84X2C + 65X2D +
75X2E + 65X2F + 70X2G + 74X2H + 90X2I +
65X2J + 57X2K + 110X2L + 98X2M + 72X2N
+ 50X3A + 55X3B + 75X3C + 60X3D + 66X3E
+ 60X3F + 67X3G + 65X3H + 80X3I + 62X3J
+ 56X3K + 95X3L + 75X3M + 68X3N
 A
B
C
D
T1
E

T2 G

T3 I

K
L
N M
 Constraints:
Assigning Job to Team: • X1I + X2I + X3I = 1
• X1A + X2A + X3A = 1 • X1J + X2J + X3J = 1
• X1B + X2B + X3B = 1 • X1K + X2K + X3K = 1
• X1C + X2C + X3C = 1 • X1L + X2L + X3L = 1
• X1D + X2D + X3D = 1 • X1M + X2M + X3M = 1
• X1E + X2E + X3E = 1 • X1N + X2N + X3N = 1
• X1F + X2F + X3F = 1
• X1G + X2G+ X3G = 1
• X1H + X2H + X3H = 1
Assigning Team to Job: (Team 1 has five members, team 2 has four
members, and team 3 has three members.)

• X1A + X1B + X1C + X1D + X1E + X1F + X1G + X1H + X1I + X1J + X1K + X1L + X1M +
X1N >= 5

• X2A + X2B + X2C + X2D + X2E + X2F + X2G + X2H + X2I + X2J + X2K + X2L + X2M +
X2N >= 4

• X3A + X3B + X3C + X3D + X3E + X3F + X3G + X3H + X3I + X3J + X3K + X3L + X3M +
X3N >= 3
Time Constraint: (Each team works 10 hours a day, but
because of the heat plus work breaks, each team actually
works only 45 minutes out of every hour. )

• 45X1A + 67X1B + 90X1C + 61X1D + 75X1E + X1F + 65X1G +

67X1H + 95X1I + 60X1J + 47X1K + 114X1L + 85X1M + 63X1N
<= 450 min

• 65X2A + 72X2B + 105X2C + 78X2D + 93X2E + 70X2F +

83X2G + 84X2H + 110X2I + 78X2J + 64X2K + 135X2L +
107X2M + 81X2N <= 450 min

• 78X3A + 85X3B + 125X3C + 97X3D + 107X3E + 95X3F +

110X3G + 100X3H + 130X3I + 95X3J + 84X3K + 155X3L +
125X3M + 102X3N <= 450 min
Cost Constraint:

• 48X1A + 70X1B + 94X1C + 65X1D + 80X1E

+ 55X1F + 70X1G + 72X1H + 100X1I +
65X1J + 55X1K + 118X1L + 90X1M +
67X1N + 55X2A + 60X2B + 84X2C + 65X2D
+ 75X2E + 65X2F + 70X2G + 74X2H +
90X2I + 65X2J + 57X2K + 110X2L + 98X2M
+ 72X2N + 50X3A + 55X3B + 75X3C +
60X3D + 66X3E + 60X3F + 67X3G +
65X3H + 80X3I + 62X3J + 56X3K + 95X3L
+ 75X3M + 68X3N <= $ 1000
 Generic Formulation:
Indices:
• Teams representation = i where i = 1,2,3
• Jobs representation = j where j = A, B, C, …, N
Notations:
• Time taken by the team ‘i’ to do job ‘j’ = Tij
• Cost of team ‘i’ to do job ‘j’ = Cij
• job ‘j’ assign to team ‘i’ = xij
• Max team member = Max I where Max I = 5,4,3
• Total Time = 450 = TT
• Total Budget = 1000 = TB
 Time Minimization:
Objective Function:

Z =45X1A + 67X1B + 90X1C + 61X1D + 75X1E + 48X1F + 65X1G + 67X1H + 95X1I +

60X1J + 47X1K + 114X1L + 85X1M + 63X1N + 65X2A + 72X2B + 105X2C + 78X2D +
93X2E + 70X2F + 83X2G + 84X2H + 110X2I + 78X2J + 64X2K + 135X2L + 107X2M +
81X2N + 78X3A + 85X3B + 125X3C + 97X3D + 107X3E + 95X3F + 110X3G + 100X3H +
130X3I + 95X3J + 84X3K + 155X3L + 125X3M + 102X3N
 Cost Minimization:
Objective Function:

Z =48X1A + 70X1B + 94X1C + 65X1D + 80X1E + 55X1F + 70X1G + 72X1H + 100X1I +

65X1J + 55X1K + 118X1L + 90X1M + 67X1N + 55X2A + 60X2B + 84X2C + 65X2D +
75X2E + 65X2F + 70X2G + 74X2H + 90X2I + 65X2J + 57X2K + 110X2L + 98X2M +
72X2N + 50X3A + 55X3B + 75X3C + 60X3D + 66X3E + 60X3F + 67X3G + 65X3H + 80X3I
+ 62X3J + 56X3K + 95X3L + 75X3M + 68X3N
 Constraints:
Assigning Job to Team: • X1J + X2J + X3J = 1
• X1A + X2A + X3A = 1 • X1K + X2K + X3K = 1
• X1B + X2B + X3B = 1 • X1L + X2L + X3L = 1
• X1C + X2C + X3C = 1 • X1M + X2M + X3M = 1
• X1D + X2D + X3D = 1 • X1N + X2N + X3N = 1
• X1E + X2E + X3E = 1
• X1F + X2F + X3F = 1
• X1G + X2G+ X3G = 1
• X1H + X2H + X3H = 1
• X1I + X2I + X3I = 1
Assigning Team to Job:
• X1A + X1B + X1C + X1D + X1E + X1F + X1G + X1H + X1I + X1J + X1K + X1L + X1M + X1N
>= 5

• X2A + X2B + X2C + X2D + X2E + X2F + X2G + X2H + X2I + X2J + X2K + X2L + X2M + X2N
>= 4

• X3A + X3B + X3C + X3D + X3E + X3F + X3G + X3H + X3I + X3J + X3K + X3L + X3M + X3N
>= 3
Time Constraint:
• 45X1A + 67X1B + 90X1C + 61X1D + 75X1E + X1F + 65X1G + 67X1H + 95X1I + 60X1J +
47X1K + 114X1L + 85X1M + 63X1N <= 450 min

• 65X2A + 72X2B + 105X2C + 78X2D + 93X2E + 70X2F + 83X2G + 84X2H + 110X2I +

78X2J + 64X2K + 135X2L + 107X2M + 81X2N <= 450 min

• 78X3A + 85X3B + 125X3C + 97X3D + 107X3E + 95X3F + 110X3G + 100X3H + 130X3I +

95X3J + 84X3K + 155X3L + 125X3M + 102X3N <= 450 min
Cost Constraint
48X1A + 70X1B + 94X1C + 65X1D + 80X1E + 55X1F + 70X1G + 72X1H + 100X1I +
65X1J + 55X1K + 118X1L + 90X1M + 67X1N + 55X2A + 60X2B + 84X2C + 65X2D +
75X2E + 65X2F + 70X2G + 74X2H + 90X2I + 65X2J + 57X2K + 110X2L + 98X2M +
72X2N + 50X3A + 55X3B + 75X3C + 60X3D + 66X3E + 60X3F + 67X3G + 65X3H +
80X3I + 62X3J + 56X3K + 95X3L + 75X3M + 68X3N <= $ 1000
 Variables Value
X1A 1
Results: X1D 1
X1F 1
• Cost Minimization: X1H 1
X1K 1
X1N 1
Objective Value: X2B 1
Z = $ 966 X2C 1
X2E 1
Model Class: X2G 1
Total Variables = 42 X2J 1
The Value of all other X3I 1
variables = 0 X3L 1
X3M 1
 A
B
C
D
T1
E

T2 G

T3 I

K
L
N M
 Verification:
• Objective Value:
Z = 48X1A(1) + 70X1B(0) + 94X1C(0) + 65X1D(1) + 80X1E(0) + 55X1F(1) +
70X1G(0) + 72X1H(1) + 100X1I(0) + 65X1J(0) + 55X1K(1) + 118X1L(0) + 90X1M(0) +
67X1N(1) + 55X2A(0) + 60X2B(1) + 84X2C(1) + 65X2D(0) + 75X2E(1) + 65X2F(0) +
70X2G(1) + 74X2H(0) + 90X2I(0) + 65X2J(1) + 57X2K(0) + 110X2L(0) + 98X2M(0) +
72X2N(0) + 50X3A(0) + 55X3B(0) + 75X3C(0) + 60X3D(0) + 66X3E(0) + 60X3F(0) +
67X3G(0) + 65X3H(0) + 80X3I(1) + 62X3J(0) + 56X3K(0) + 95X3L(1) + 75X3M(1) +
68X3N(0)
Putting values of variables
Z = 48(1) + 65(1) + 55(1) + 72(1) + 55(1) + 67(1) + 60(1) + 84(1) + 75(1) + 70(1)
+ 65(1) + 80(1) + 95(1) + 75(1) = $ 966
 Variables Value
• Constraints:
X1A 1
From Job to Team X1D 1
1. X1A + X2A + X3A = 1 8. 1 + 0 + 0 = 1 X1F 1
2. X1B + X2B + X3B = 1 9. 0 + 1 + 0 = 1 X1H 1
X1K 1
3. X1C + X2C + X3C = 1 10. 0 + 1 + 0 = 1 X1N 1
4. X1D + X2D + X3D = 1 11. 1 + 0 + 0 = 1 X2B 1
5. X1E + X2E + X3E = 1 12. 0 + 1 + 0 = 1 X2C 1
X2E 1
6. X1F + X2F + X3F = 1 13. 1 + 0 + 0 = 1
X2G 1
7. X1G + X2G+ X3G = 1 14. 0 + 1+ 0 = 1 X2J 1
X3I 1
X3L 1
X3M 1
 Variables Value
1. X1H + X2H + X3H = 1 X1A 1
1. 1+0+0=1
2. X1I + X2I + X3I = 1 X1D 1
2. 0+0+1=1
3. X1J + X2J + X3J = 1 X1F 1
3. 0+1+0=1
4. X1K + X2K + X3K = 1 X1H 1
4. 1+0+0=1
5. X1L + X2L + X3L = 1
5. 0+0+1=1 X1K 1
6. X1M + X2M + X3M = 1
6. 0+0+1=1 X1N 1
7. X1N + X2N + X3N = 1
7. 1+0+0=1 X2B 1
X2C 1
X2E 1
X2G 1
X2J 1
X3I 1
X3L 1
X3M 1
• From Team to Job Variables Value
1. X1A(1)+ X1B(0) + X1C(0) + X1D(1) + X1E(0) + X1F(1) + X1G(0) + X1A 1
X1H(1) + X1I(0) + X1J(0) + X1K(1) + X1L(0) + X1M(0) + X1N(1) >= X1D 1
5 X1F 1
1 + 1 + 1 + 1 + 1 + 1 >= 5 X1H 1
6 >= 5 X1K 1
X1N 1
X2B 1
2. X2A(0) + X2B(1) + X2C(1) + X2D(0) + X2E(1) + X2F(0) + X2G(1) + X2C 1
X2H(0) + X2I(0) + X2J(1) + X2K(0) + X2L(0) + X2M(0) + X2N(0) >= 4 X2E 1
1 + 1 + 1 + 1 + 1 >= 4 X2G 1
5 >= 4 X2J 1
X3I 1
3. X3A(0) + X3B(0) + X3C(0) + X3D(0) + X3E(0) + X3F(0) + X3G(0) + X3L 1
X3H(0) + X3I(1) + X3J(0) + X3K(0) + X3L(1) + X3M(1) + X3N(0) >= 3 X3M 1
1 + 1 + 1 >= 3
3 >= 3
• For Time:
1. 45X1A(1) + 67X1B(0) + 90X1C(0) + 61X1D(1) + 75X1E(0) +48X1F(1) +
65X1G(0) + 67X1H(1) + 95X1I(0) + 60X1J(0) + 47X1K(1) + 114X1L(0) +
85X1M(0) + 63X1N(1) <= 450 min
45(1) + 61(1) + 48(1) + 67(1) + 47(1) + 63(1) <= 450 min
331 <= 450 min

2. 65X2A(0) + 72X2B(1) + 105X2C(1) + 78X2D(0) + 93X2E(1) + 70X2F(0)

+ 83X2G(1) + 84X2H(0) + 110X2I(0) + 78X2J(1) + 64X2K(0) + 135X2L(0) +
107X2M(0) + 81X2N(0) <= 450 min
72(1) + 105(1) + 93(1) + 83(1) + 78(1) <= 450 min
431 <= 450 min

3. 78X3A(0) + 85X3B(0) + 125X3C(0) + 97X3D(0) + 107X3E(0) +

95X3F(0) + 110X3G(0) + 100X3H(0) + 130X3I(1) + 95X3J(0) + 84X3K(0) +
155X3L(1) + 125X3M(1) + 102X3N(0) <= 450 min
130(1) + 155(1) + 125(1) <= 450 min
410 <= 450 min
• For Cost: Variables Value
X1A 1
48X1A(1) + 70X1B(0) + 94X1C(0) + 65X1D(1) + 80X1E(0) + 55X1F(1) + X1D 1
70X1G(0) + 72X1H(1) + 100X1I(0) + 65X1J(0) + 55X1K(1) + 118X1L(0) X1F 1
+ 90X1M(0) + 67X1N(1) + 55X2A(0) + 60X2B(1) + 84X2C(1) + 65X2D(0) X1H 1
+ 75X2E(1) + 65X2F(0) + 70X2G(1) + 74X2H(0) + 90X2I(0) + 65X2J(1) + X1K 1
57X2K(0) + 110X2L(0) + 98X2M(0) + 72X2N(0) + 50X3A(0) + 55X3B(0) X1N 1
+ 75X3C(0) + 60X3D(0) + 66X3E(0) + 60X3F(0) + 67X3G(0) + 65X3H(0) X2B 1
+ 80X3I(1) + 62X3J(0) + 56X3K(0) + 95X3L(1) + 75X3M(1) + 68X3N(0) X2C 1
<= $ 1000 X2E 1
X2G 1
48(1) + 65(1) + 55(1) + 72(1) + 55(1) + 67(1) + 60(1) + 84(1) + X2J 1
75(1) + 70(1) + 65(1) + 80(1) + 95(1) + 75(1) <= $ 1000 X3I 1
$ 966 <= $ 1000 X3L 1
X3M 1
 Variables Value
X1A 1
Results: X1F 1
X1G 1
• Time Minimization: X1J 1
Objective Value: X1K 1
Z = 1133 min X1M 1
X1N 1
Model Class:
X2C 1
Total Variables = 42 X2D 1
The Value of all other X2I 1
variables = 0 X2L 1
X3B 1
X3E 1
X3H 1
 A
B
C
D
T1
E

T2 G

T3 I

K
L
N M
 Verification: Variables Value
• Objective Value X1A 1
X1F 1
Z = 45X1A(1) + 67X1B(0) + 90X1C(0) + 61X1D(0) + 75X1E(0) +
X1G 1
48X1F(1) + 65X1G(1) + 67X1H(0) + 95X1I(0) + 60X1J(1) + 47X1K(1)
X1J 1
+ 114X1L(0) + 85X1M(1) + 63X1N(1) + 65X2A(0) + 72X2B(0) +
X1K 1
105X2C(1) + 78X2D(1) + 93X2E(0) + 70X2F(0) + 83X2G(0) +
X1M 1
84X2H(0) + 110X2I(1) + 78X2J(0) + 64X2K(0) + 135X2L(1) +
X1N 1
107X2M(0) + 81X2N(0) + 78X3A(0) + 85X3B(1) + 125X3C(0) +
X2C 1
97X3D(0) + 107X3E(1) + 95X3F(0) + 110X3G(0) + 100X3H(1) +
X2D 1
130X3I(0) + 95X3J(0) + 84X3K(0) + 155X3L(0) + 125X3M(0) +
X2I 1
102X3N(0)
X2L 1
Putting Values X3B 1
Z = 45(1) + 48(1) + 65(1) + 60(1) + 47(1) + 85(1) + 63(1) + X3E 1
105(1) + 78(1) + 110(1) + 135(1) + 85(1) + 107(1) + 100(1) = X3H 1
1133
 Variables Value
• Constraints: 9. 0 + 0 + 1 = 1
X1A 1
From Job to Team 10. 0 + 1 + 0 = 1
X1F 1
1. X1A + X2A + X3A = 1 11. 0 + 1 + 0 = 1
X1G 1
2. X1B + X2B + X3B = 1 12. 0 + 0 + 1 = 1
X1J 1
3. X1C + X2C + X3C = 1 13. 1 + 0 + 0 = 1
X1K 1
4. X1D + X2D + X3D = 1 14. 1 + 0+ 0 = 1
X1M 1
5. X1E + X2E + X3E = 1
X1N 1
6. X1F + X2F + X3F = 1
X2C 1
7. X1G + X2G+ X3G = 1
X2D 1
X2I 1
X2L 1
X3B 1
X3E 1
X3H 1
8. 1 + 0 + 0 = 1
 Variables Value
1. X1H + X2H + X3H = 1 X1A 1
2. X1I + X2I + X3I = 1 1. 0+0+1=1 X1F 1
2. 0+1+0=1 X1G 1
3. X1J + X2J + X3J = 1
3. 1+0+0=1 X1J 1
4. X1K + X2K + X3K = 1
4. 1+0+0=1 X1K 1
5. X1L + X2L + X3L = 1 5. 0+1+0=1 X1M 1
6. X1M + X2M + X3M = 1 6. 1+0+0=1 X1N 1
7. X1N + X2N + X3N = 1 7. 1+0+0=1 X2C 1
X2D 1
X2I 1
X2L 1
X3B 1
X3E 1
X3H 1
• From Team to Job Variables Value
1. X1A(1)+ X1B(0) + X1C(0) + X1D(0) + X1E(0) + X1F(1) + X1G(1) + X1A 1
X1H(0) + X1I(0) + X1J(1) + X1K(1) + X1L(0) + X1M(1) + X1N(1) X1F 1
>= 5 X1G 1
1 + 1 + 1 + 1 + 1 + 1 + 1 >= 5 X1J 1
7 >= 5 X1K 1
X1M 1
2. X2A(0) + X2B(0) + X2C(1) + X2D(1) + X2E(0) + X2F(0) + X2G(0) + X1N 1
X2H(0) + X2I(1) + X2J(0) + X2K(0) + X2L(1) + X2M(0) + X2N(0) >= 4
X2C 1
1 + 1 + 1 + 1 >= 4
X2D 1
4 >= 4
X2I 1
X2L 1
3. X3A(0) + X3B(1) + X3C(0) + X3D(0) + X3E(1) + X3F(0) + X3G(0) +
X3H(1) + X3I(0) + X3J(0) + X3K(0) + X3L(0) + X3M(0) + X3N(0) >= 3 X3B 1
1 + 1 + 1 >= 3 X3E 1
3 >= 3 X3H 1
• For Time: Variables Value
1. 45X1A(1) + 67X1B(0) + 90X1C(0) + 61X1D(0) + 75X1E(0) + 48X1F(1) +
X1A 1
65X1G(1) + 67X1H(0) + 95X1I(0) + 60X1J(1) + 47X1K(1) + 114X1L(0) +
85X1M(1) + 63X1N(1) <= 450 min X1F 1
45(1) + 48(1) + 65(1) + 60(1) + 47(1) + 85(1) + 63(1) <= 450 min X1G 1
413 <= 450 min X1J 1
2. 65X2A (0)+ 72X2B(0) + 105X2C (1)+ 78X2D(1) + 93X2E(0) + 70X2F(0) + X1K 1
83X2G(0) + 84X2H(0) + 110X2I(1) + 78X2J(0) + 64X2K(0) + 135X2L(1) + X1M 1
107X2M(0) + 81X2N(0) <= 450 min X1N 1
105(1) + 78(1) + 110(1) + 135(1) <= 450 min X2C 1
428 <= 450 min X2D 1
3. 78X3A(0) + 85X3B(1) + 125X3C(0) + 97X3D(0) + 107X3E(1) + 95X3F(0) + X2I 1
110X3G(0) + 100X3H(1) + 130X3I(0) + 95X3J(0) + 84X3K(0) + 155X3L(0) +
X2L 1
125X3M(0) + 102X3N(0) <= 450 min
85(1) + 107(1) + 100(1) <= 450 min
X3B 1
292 <= 450 min
X3E 1
X3H 1
• For Cost: Variables Value
48X1A(1) + 70X1B(0) + 94X1C(0) + 65X1D(0) + 80X1E(0) + X1A 1
55X1F(1) + 70X1G(1) + 72X1H(0) + 100X1I(0) + 65X1J(1) + X1F 1
55X1K(1) + 118X1L(0) + 90X1M(1) + 67X1N(1) + 55X2A(0) + X1G 1
60X2B(0) + 84X2C(1) + 65X2D(1) + 75X2E(0) + 65X2F(0) +
70X2G(0) + 74X2H(0) + 90X2I(1) + 65X2J(0) + 57X2K(0) + X1J 1
110X2L(1) + 98X2M(0) + 72X2N(0) + 50X3A(0) + 55X3B(1) + X1K 1
75X3C(0) + 60X3D(0) + 66X3E(1) + 60X3F(0) + 67X3G(0) + X1M 1
65X3H(1) + 80X3I(0) + 62X3J(0) + 56X3K(0) + 95X3L(0) + X1N 1
75X3M(0) + 68X3N(0) <= $ 1000 X2C 1
X2D 1
48(1) + 55(1) + 70(1) + 65(1) + 55(1) + 90(1) + 67(1) + 84(1) + X2I 1
65(1)+ 90(1) + 110(1) + 55(1) + 66(1) + 65(1) <= $ 1000
X2L 1
$ 985 <= $ 1000
X3B 1
X3E 1
X3H 1
Comparison
 Cost Minimization Time Minimization
Variables Value Variables Value
• Objective Value: X1A 1 • Objective Value:
Z = $ 966 X1D 1 Z = 1133 min X1A 1
For Time
X1F 1 X1F 1
For Time Team 1 (7 jobs)
X1H 1 413 <= 450 min X1G 1
Team 1 (6 jobs) X1J 1
331 <= 450 min X1K 1
X1N 1 Team 2 (4 jobs) X1K 1
428 <= 450 min X1M 1
Team 2 (5 jobs) X2B 1
X1N 1
431 <= 450 min X2C 1
Team 3 (3 jobs) X2C 1
X2E 1
292 <= 450 min X2D 1
Team 3 (3 jobs) X2G 1 X2I 1
410 <= 450 min X2J 1 X2L 1
X3I 1 For Cost:
X3B 1
Total time=1172 min X3L 1 $ 985 <= $ 1000
X3E 1
X3M 1 X3H 1
 Solution when Demand Constraints Removed
Assigning Team to Job: (Team 1 has five members, team 2 has four members, and
team 3 has three members.)

• X1A + X1B + X1C + X1D + X1E + X1F + X1G + X1H + X1I + X1J + X1K + X1L + X1M + X1N >= 5

• X2A + X2B + X2C + X2D + X2E + X2F + X2G + X2H + X2I + X2J + X2K + X2L + X2M + X2N >= 4

• X3A + X3B + X3C + X3D + X3E + X3F + X3G + X3H + X3I + X3J + X3K + X3L + X3M + X3N >= 3
 Variables Value
X1A 1
Results: X1E 1
X1F 1
• Time Minimization: X1G 1
Objective Value: X1J 1
Z = 1122 min X1M 1
X1N 1
Model Class:
X2C 1
Total Variables = 42 X2D 1
The Value of all other X2H 1
variables = 0 X2I 1
X2K 1
X3B 1
X3L 1
 Verification: Variables Value
• Objective Value X1A 1
X1E 1
Z = 45X1A(1) + 67X1B(0) + 90X1C(0) + 61X1D(0) + 75X1E(1) +
48X1F(1) + 65X1G(1) + 67X1H(0) + 95X1I(0) + 60X1J(1) + X1F 1
47X1K(0) + 114X1L(0) + 85X1M(1) + 63X1N(1) + 65X2A(0) + X1G 1
72X2B(0) + 105X2C(1) + 78X2D(1) + 93X2E(0) + 70X2F(0) + X1J 1
83X2G(0) + 84X2H(1) + 110X2I(1) + 78X2J(0) + 64X2K(1) + X1M 1
135X2L(0) + 107X2M(0) + 81X2N(0) + 78X3A(0) + 85X3B(1) + X1N 1
125X3C(0) + 97X3D(0) + 107X3E(0) + 95X3F(0) + 110X3G(0) + X2C 1
100X3H(0) + 130X3I(0) + 95X3J(0) + 84X3K(0) + 155X3L(1) + X2D 1
125X3M(0) + 102X3N(0) X2H 1
Putting Values X2I 1
Z = 45(1) + 75(1)+48(1) + 65(1) + 60(1) + 85(1) + 63(1) + X2K 1
105(1) + 78(1) +84(1)+ 110(1) + 64(1) + 85(1) + 155(1) = X3B 1
1122min X3L 1
 Variables Value
• Constraints: 9. 0 + 0 + 1 = 1
X1A 1
From Job to Team 10. 0 + 1 + 0 = 1
1. X1A + X2A + X3A = 1 11. 0 + 1 + 0 = 1 X1E 1
2. X1B + X2B + X3B = 1 12. 1 + 0 + 0 = 1 X1F 1
3. X1C + X2C + X3C = 1 13. 1 + 0 + 0 = 1 X1G 1
4. X1D + X2D + X3D = 1 14. 1 + 0+ 0 = 1 X1J 1
5. X1E + X2E + X3E = 1 X1M 1
6. X1F + X2F + X3F = 1 X1N 1
7. X1G + X2G+ X3G = 1 X2C 1
X2D 1
X2H 1
X2I 1
X2K 1
X3B 1
8. 1 + 0 + 0 = 1
X3L 1
 Variables Value
1. X1H + X2H + X3H = 1 X1A 1
2. X1I + X2I + X3I = 1 1. 0+1+0=1 X1E 1
2. 0+1+0=1 X1F 1
3. X1J + X2J + X3J = 1
3. 1+0+0=1 X1G 1
4. X1K + X2K + X3K = 1
4. 0+1+0=1 X1J 1
5. X1L + X2L + X3L = 1 5. 0+0+1=1 X1M 1
6. X1M + X2M + X3M = 1 6. 1+0+0=1 X1N 1
7. X1N + X2N + X3N = 1 7. 1+0+0=1 X2C 1
X2D 1
X2H 1
X2I 1
X2K 1
X3B 1
X3L 1
• For Time: Variables Value
1. 45X1A(1) + 67X1B(0) + 90X1C(0) + 61X1D(0) + 75X1E(1) + 48X1F(1) + X1A 1
65X1G(1) + 67X1H(0) + 95X1I(0) + 60X1J(1) + 47X1K(0) + 114X1L(0) + X1E 1
85X1M(1) + 63X1N(1) <= 450 min
X1F 1
45(1)+75(1) + 48(1) + 65(1) + 60(1) + 85(1) + 63(1) <= 450 min
X1G 1
441 <= 450 min
X1J 1
2. 65X2A (0)+ 72X2B(0) + 105X2C (1)+ 78X2D(1) + 93X2E(0) + 70X2F(0) +
83X2G(0) + 84X2H(1) + 110X2I(1) + 78X2J(0) + 64X2K(1) + 135X2L(0) + X1M 1
107X2M(0) + 81X2N(0) <= 450 min X1N 1
105(1) + 78(1)+84(1) + 110(1) + 64(1) <= 450 min X2C 1
441 <= 450 min X2D 1
3. 78X3A(0) + 85X3B(1) + 125X3C(0) + 97X3D(0) + 107X3E(0) + 95X3F(0) + X2H 1
110X3G(0) + 100X3H(0) + 130X3I(0) + 95X3J(0) + 84X3K(0) + 155X3L(1) +
X2I 1
125X3M(0) + 102X3N(0) <= 450 min
X2K 1
85(1) + 155(1) <= 450 min
240 <= 450 min X3B 1
X3L 1
• For Cost: Variables Value
48X1A(1) + 70X1B(0) + 94X1C(0) + 65X1D(0) + 80X1E(1) + X1A 1
55X1F(1) + 70X1G(1) + 72X1H(0) + 100X1I(0) + 65X1J(1) + X1E 1
55X1K(0) + 118X1L(0) + 90X1M(1) + 67X1N(1) + 55X2A(0) +
60X2B(0) + 84X2C(1) + 65X2D(1) + 75X2E(0) + 65X2F(0) + X1F 1
70X2G(0) + 74X2H(1) + 90X2I(1) + 65X2J(0) + 57X2K(1) + X1G 1
110X2L(0) + 98X2M(0) + 72X2N(0) + 50X3A(0) + 55X3B(1) + X1J 1
75X3C(0) + 60X3D(0) + 66X3E(0) + 60X3F(0) + 67X3G(0) +
65X3H(0) + 80X3I(0) + 62X3J(0) + 56X3K(0) + 95X3L(1) + X1M 1
75X3M(0) + 68X3N(0) <= $ 1000 X1N 1
X2C 1
48(1) +80(1)+ 55(1) + 70(1) + 65(1) + 90(1) + 67(1) + 84(1) + X2D 1
65(1)+74(1)+ 90(1) +57(1) + 55(1) + 95(1) <= $ 1000 X2H 1
$ 995 <= $ 1000 X2I 1
X2K 1
X3B 1
X3L 1
 Variables Value
X1A 1
Results: X1F 1
X1G 1
• Cost Minimization: X1H 1
X1J 1
X1K 1
Objective Value: X1N 1
Z = $ 966 X2B 1
X2C 1
Model Class: X2D 1
Total Variables = 42 X2E 1
The Value of all other X3I 1
variables = 0 X3L 1
X3M 1
 Variables Value
• For Cost:
48X1A(1) + 70X1B(0) + 94X1C(0) + 65X1D(0) + 80X1E(0) + 55X1F(1) X1A 1
+ 70X1G(1) + 72X1H(1) + 100X1I(0) + 65X1J(1) + 55X1K(1) + X1F 1
118X1L(0) + 90X1M(0) + 67X1N(1) + 55X2A(0) + 60X2B(1) + X1G 1
84X2C(1) + 65X2D(1) + 75X2E(1) + 65X2F(0) + 70X2G(0) + 74X2H(0) X1H 1
+ 90X2I(0) + 65X2J(0) + 57X2K(0) + 110X2L(0) + 98X2M(0) + X1J 1
72X2N(0) + 50X3A(0) + 55X3B(0) + 75X3C(0) + 60X3D(0) + 66X3E(0) X1K 1
+ 60X3F(0) + 67X3G(0) + 65X3H(0) + 80X3I(1) + 62X3J(0) +56X3K(0) X1N 1
+ 95X3L(1) + 75X3M(1) + 68X3N(0) <= $ 1000 X2B 1
48(1) + 55(1)+ 70(1) + 72(1)+65(1) + 55(1) + 67(1) + 60(1) + X2C 1
84(1)+65(1) + 75(1) + 80(1) + 95(1) + 75(1) <= $ 1000 X2D 1
$ 966 <= $ 1000 X2E 1
X3I 1
X3L 1
X3M 1
 Variables Value
• Constraints: 9. 0 + 1 + 0 = 1
From Job to Team 10. 0 + 1 + 0 = 1 X1A 1
1. X1A + X2A + X3A = 1 11. 0 + 1 + 0 = 1 X1F 1
2. X1B + X2B + X3B = 1 12. 0 + 1 + 0 = 1 X1G 1
3. X1C + X2C + X3C = 1 13. 1 + 0 + 0 = 1 X1H 1
4. X1D + X2D + X3D = 1 14. 1 + 0+ 0 = 1 X1J 1
5. X1E + X2E + X3E = 1 X1K 1
6. X1F + X2F + X3F = 1 X1N 1
7. X1G + X2G+ X3G = 1 X2B 1
X2C 1
X2D 1
X2E 1
X3I 1
X3L 1
8. 1 + 0 + 0 = 1 X3M 1
 Variables Value
1. X1H + X2H + X3H = 1 X1A 1
2. X1I + X2I + X3I = 1 1. 1+0+0=1 X1F 1
3. X1J + X2J + X3J = 1 2. 0+0+1=1
X1G 1
3. 1+0+0=1
4. X1K + X2K + X3K = 1 X1H 1
4. 1+0+0=1
5. X1L + X2L + X3L = 1 X1J 1
5. 0+0+1=1
6. X1M + X2M + X3M = 1 6. 0+0+1=1 X1K 1
7. X1N + X2N + X3N = 1 7. 1+0+0=1 X1N 1
X2B 1
X2C 1
X2D 1
X2E 1
X3I 1
X3L 1
• For Time: Variables Value
1. 45X1A(1) + 67X1B(0) + 90X1C(0) + 61X1D(0) + 75X1E(0) + 48X1F(1) + X1A 1
65X1G(1) + 67X1H(1) + 95X1I(0) + 60X1J(1) + 47X1K(1) + 114X1L(0) +
85X1M(0) + 63X1N(1) <= 450 min X1F 1
45(1) + 48(1) + 65(1) + 67(1)+60(1)+47(1) + 63(1) <= 450 min X1G 1
395 <= 450 min X1H 1
2. 65X2A (0)+ 72X2B(1) + 105X2C (1)+ 78X2D(1) + 93X2E(1) + 70X2F(0) + X1J 1
83X2G(0) + 84X2H(0) + 110X2I(0) + 78X2J(0) + 64X2K(0) + 135X2L(0) + X1K 1
107X2M(0) + 81X2N(0) <= 450 min X1N 1
72(1) + 105(1) + 78(1)+93(1) <= 450 min X2B 1
348 <= 450 min X2C 1
3. 78X3A(0) + 85X3B(0) + 125X3C(0) + 97X3D(0) + 107X3E(0) + 95X3F(0) + X2D 1
110X3G(0) + 100X3H(0) + 130X3I(1) + 95X3J(0) + 84X3K(0) + 155X3L(1) + X2E 1
125X3M(1) + 102X3N(0) <= 450 min
X3I 1
130(1) + 155(1) + 125(1)<= 450 min
X3L 1
410 <= 450 min
X3M 1
 Cost Minimization Time Minimization
Variables Value Variables Value
• Objective Value: • Objective Value: X1A 1
Z = $ 966 X1A 1 Z = 1122 min X1E 1
X1F 1 First it was X1F 1
X1G 1 Z = 1133 min
For Time X1G 1
X1H 1
For Time Team 1 (7 jobs) X1J 1
X1J 1
Team 1 (7 jobs) 441 <= 450 min X1M 1
X1K 1
395 <= 450 min Team 2 (5 jobs) X1N 1
X1N 1
441 <= 450 min X2C 1
Team 2 (4 jobs) X2B 1
Team 3 (2 jobs) X2D 1
348 <= 450 min X2C 1 240 <= 450 min
X2D 1 X2H 1
Team 3 (3 jobs) X2E 1 X2I 1
For Cost: X2K 1
410 <= 450 min X3I 1
$ 995 <= $ 1000
X3L 1 X3B 1
Total time = 1153 min
X3M 1 X3L 1
 Solution with demand constraints Solution without demand constraints
Cost Minimization Time Minimization

• Objective Value: • Objective Value:

Z = $ 966 Z = 1122 min
For Time
For Time
Team 1 (7 jobs)
Team 1 (7 jobs)
441 <= 450 min
395 <= 450 min
Team 2 (5 jobs)
Team 2 (4 jobs)
441 <= 450 min
348 <= 450 min
Team 3 (2 jobs)
Team 3 (3 jobs)
240 <= 450 min
410 <= 450 min
For Cost:
Total time=1172 min For cost <= $985 Total time = 1153 min
$ 995 <= $ 1000
 Selection of Model
• The choice between the two models depends on the WeeMow
manager's priorities.
• If the manager's priority is to minimize the total job time for the day,
then they should choose the first model that minimizes the total time.
• However, if the manager's priority is to minimize costs, then they should
choose the second model that minimizes the total cost.