Documente Academic
Documente Profesional
Documente Cultură
Sachin Jayaswal
Indian Institute of Management Ahmedabad
sachin@iimahd.ernet.in
Rothstein, M. 1973. Hospital manpower shift scheduling by Mathematical Programming. Health Services Research, 8 (1), 60-66.
Objective
Objective Function:
Minimize
y1 + y2 + y3 + y4 + y5 + y6 + y7 ???
Constraints:
1. Workers on day j is at least dj
Demand
17
13
15
Thurs
Fri
Sat
Sun
19
14
16
11
Minimize z = x1 + x2 + x3 + x4 + x5 + x6 + x7
subject to
x1 +
x4 + x5 + x6 + x7 17
x1 + x2 +
x5 + x6 + x7 13
x1 + x2 + x3 +
x6 + x7 15
x1 + x2 + x3 + x4 +
x7 19
x1 + x2 + x3 + x4 + x5
14
x2 + x3 + x4 + x5 + x6
16
x3 + x4 + x5 + x6 + x7 11
xj 0 for j = 1 to 7
Enhancements
Suppose one wants to minimize the maximum of the
excesses:
x4 + x5 + x6 + x7 17
x1 +
x5 + x6 + x7 13
x1 + x 2 +
x1 + x 2 + x 3 +
x6 + x7 15
x1 + x 2 + x 3 + x 4 +
x1 + x 2 + x 3 + x 4 + x5
x2 + x 3 + x 4 + x 5 + x 6
x7 19
14
16
x3 + x4 + x5 + x6 + x7 11
xj 0 for j = 1 to 7
Is the Objective Function Linear?
Can it be made Linear?
z = x1 if x1 x2
z = x2 if x2 x1
How can you rewrite: Minimize Max (x1, x2)?
If we rewrite it as:
Minimize z
then,
z x1
z x1
z
x1 +
x4 + x5 + x6 + x7
17
x5 + x6 + x7
13
x6 + x7
15
x7
19
x1 + x2 +
x1 + x2 + x3 +
x1 + x2 + x3 + x4 +
14
x1 + x2 + x3 + x4 + x5
x2 + x3 + x4 + x5 + x6
x3 + x4 + x5 + x6 + x7
16
11
xj 0 for j = 1 to 7
z x1 +
z x1 + x2
x4 + x5 + x6 + x7 - 17
+ x5 + x6 + x7 - 13
z x1 + x2 + x3 +
z x1 + x2 + x3 + x4 +
x6 + x7 - 15
x7 - 19
10
z x1 + x2 + x3 + x4 + x5
- 14
- 16
x2 + x3 + x4 + x5 + x6
x3 + x4 + x5 + x6 + x7
- 11
11
12
| yj dj |
13
If we rewrite it as:
Sz
Minimize
| yj dj |?
then,
zj yj dj
zj dj y
14
+ + + + + +
subject to z1 x1 +
z2 x1 + x2
x4 + x5 + x6 + x7 - 17
+ x5 + x6 + x7 - 13
z3 x1 + x2 + x3 +
x6 + x7 - 15
z4 x1 + x2 + x3 + x4 +
x7 - 19
z5 x1 + x2 + x3 + x4 + x5
- 14
z6
- 16
z7
x2 + x3 + x4 + x5 + x6
x3 + x4 + x5 + x6 + x7 - 11
15
Continued
z1 17 (x1 +
z2 13 (x1 + x2
x4 + x5 + x6 + x7)
+ x5 + x6 + x7)
z3 15 (x1 + x2 + x3 +
x6 + x7)
z4 19 (x1 + x2 + x3 + x4 +
x7)
z5 14 (x1 + x2 + x3 + x4 + x5)
z6 16 (
z7 11 (
x2 + x3 + x4 + x5 + x6)
x3 + x4 + x5 + x6 + x7)
16
Alternatively
Minimize
subject to
S e +S s
j
x1 +
x4 + x5 + x6 + x7 - e1 + s1 = 17
x5 + x6 + x7 e2 + s2 = 13
x1 + x2 +
x1 + x2 + x3 +
x6 + x7 e3 + s3 = 15
x1 + x2 + x3 + x4 +
x1 + x2 + x3 + x4 + x5
x2 + x3 + x4 + x5 + x6
x7 e4 + s4 = 19
- e5 + s5 = 14
- e6 + s6 = 16
x3 + x4 + x5 + x6 + x7 e7 + s7 = 11
xj 0 , for j = 1 to 7
ej 0 for j = 1 to 7.
sj 0 for j = 1 to 7.
17