Work Scheduling Problem
Work Scheduling Problem
scheduling
problem mistake
Start
time period(t) Distinguish between consecutive d
↓ non-consecutive problems
I 23 4
work
->
I
↳
2
x
y
I
12 hour shifts 18 hour shifts
2 3 ↳
t 1
2 34
t 1 2 34
x X X XX
312
3
x
E3S
0 6
1
61 X
X
->
0
x x
x
-
2 x
2
6 12
E
= 12
3 X x x XX 3 X X in
3x
12 14
X X xx
->
12
↳ X
14 -> 0
4 X 31/ 14 04
-
working
>
Let:
xi= the number
policemen
of working schedule i, where i E1,
=
...,
43
Let:
= thatstarton
xt number of policemen working is hours shirtt
where t =
5, ...,43 antt=1 represent 0.00 to 06:00, t 2
=
=
of policemen thatstarton shirtt
yt number
working is hours
minimize cost
Objective function
minz=)4oxt+anyt) or
(not+an,yt)
first shift
=12 x
4 =
$48 12 hour shift
...
(2 x4) (6 x6)
- +
$84/day
=
18 hour shift
:
Subject to Constraints ↳
x+xx +
y) +
(x +
x
yz) y4
+ 78 (period 2
requirements)
schedules i
210 0 all possible schedules
1
2 3 1878
8 I X X X x X
· x
x X
X X
A2
people working specified shift
x x x
.
3 x
x
(LINGO)
-
4 x x x x x
we are
12 hour 1 hour
when
using
must be shown
approach a schedule
Let:
xi= the number
policemen
of working schedule i, where i E1, ...,
=
OBJECTIVE FUNCTION
&
minz ci.48+
=
E xi.84 $ 1044
=
i 1
=
i =S
Subject to x1 +
(4 ks
+
x7
+
x8X...
+
12 (3 xs
+
+
x6
+
x7),6
+
13 (4 +
+
16 k7
+
+
kc 7, IS
Section 3.5 problem
x Decision variable
xi=number full time i
of employees starting on
day
:1 2 3 4 S 6 I min z x1
=
(z
+ +
x3 x4
+
xs
+
x6
+
x7
+
-X x x
x X Ecci
-
i1
x x X
=
2 X
x
3 x
x x x x
4 x
x x x X
S x x x
x x
-
1 X X
6 X
x
x x
7 X X
Constraints,
(C1 t
i4
2
=
ci <1
(monday constraint)
Exit
7
E
(monday constraint)
ci x
B
i S
=
Exit Ecci is
(monday constraint)
i 1
= i6 =
5 xi+ 7
i 1
=
x7 19
Cmonday constraint)
S
Exci >14
i1 =
(monday constraint)
6
E >16
Ki
(monday constraint)
i2 =
E xi >
i 3 =
11
(monday constraint)
xi >0 (non negativel
I 23 4 S 67 Decision variable Let
, xx XXXXXXXXX
2
XXXX xxxxxxx ci
=
the number ofworkers working days a
E1,..,73
3 XXXXXX x xxxx week, starting or work
day, where i =
4 XXXXXXXX xxx
"the
S XXXXXXXXXX X
yi =
number ofworkers workings days a
E1,..,73
b xxxxxxxxxx week, starting or work
day, where i =
7 XXXXXXXXXXX
OBJECTIVEFN
sdays=SxSO
=
250$
312$
=
S.T.cx xi
+
yi
+ +
EY:
:1 2 3 456 I
-X x x x x
2 X
x x x
x
3 x
x x x x
4 x
x x x X
S x x x
x x
-
1 X X
6 X
7 x
xxx X
Goal:minimize cost
see
134 hours
X 8 =
Let:
x =104
= the
x 8 120
=
i number offull time workers,
working schedule
x8 152
:, where i E1, ...,73
=
x 8 112
=
x0 128
=
total 840
E1, ...,73
=
hours :, where i =
labour
requirement
↳Feet
600
200
- -
$/hour) xi (4 ye
-
minz =
(hoursxsdayst is
the question
+
wants weekly
5
x 10
x
labour
labour costs
7 convert
weekly
I 600K: +200
yi
-
i1
=
manhours
LAS RHS
nong,numberworkers annou ↑
=
un its
(monday requirementin
- unit3
S. T +
4yi), 136
152
(thursday requirement)
(aci +
4yi)112 (Friday requirement)
(aci+4yi) 128
(Saturday requirement)
Eyi.4(s) - I schedule
4 hours a
day
s
days a week
I
18:00 -
0.00
12:00 -
18:00 300 nt the
=
number unsatisfied
of at
customers
18:00 -0:00 200 the end ofshiftt, where t [1, ...,43
=
etiveon
minz-i.skchous.10$)
↳
[nts
+
(mincost)
t 1
=
,
S.T m
-
+
100
M
(x +xz). so 200
+ -
Mz
(skift z)
Me
(xz x3) .50 + R3
(stift 5)
-
+
300
/200
R4 0
=
(end of day constraint)
ccix0 (non negativel ViE El, ...,43
nt 70 ↓ E El, ...,43
m e e
13.5 =
13.5
13.5
13.5
13.5
13.5
13.S
Pattern
12345678 9 10 Il 12 13 14 IS 16 17 18 1970 21
Monday 1 X
x x xxxxxxxxxxxx people not working
x x
x x x x x
x x
x xXx XX
Tuesday 2
Wednesday 3 x
x x x
x x x x
x x x x x x X
Thursday 4 x x
x x x x
x x x x x x
x X X
X x X X
x x X
x x x x
x x xx
Friday S
Decision variables
...,
...,
Objective function
max z
y1 y3 yx y10 y1s y(6 yz)
+ +
+ + +
= +
subjectto
Eyi (30-5.5)
=
people not
working
Assignmentz
M Mx X
A X X MM 9
TMX X A 10
X
A X
WM x X TM I
A
x X A
10
+M x X
A
7 X
F M x X
Ax X