Scribd
Upload
6 views1 page

Staff Scheduling and Blending Optimization

This document contains descriptions of two optimization problems. The first involves scheduling nurses across seven shifts per week to minimize salary costs while meeting demand constraints for each day of the week. The second involves determining the optimal blend of ores from four mines to minimize costs while meeting constraints on elements and total weight, with decision variables representing the amount of each ore in each ton of the blend.

Uploaded by

api-26315128
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
6 views1 page

Staff Scheduling and Blending Optimization

This document contains descriptions of two optimization problems. The first involves scheduling nurses across seven shifts per week to minimize salary costs while meeting demand constraints for each day of the week. The second involves determining the optimal blend of ores from four mines to minimize costs while meeting constraints on elements and total weight, with decision variables representing the amount of each ore in each ton of the blend.

Uploaded by

api-26315128
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

1.

Staff scheduling:
Decision variables
x1: # of RNs on schedule 1;
x2: # of RNs on schedule 2;
x3: # of RNs on schedule 3;
x4: # of RNs on schedule 4;
x5: # of RNs on schedule 5;
x6: # of RNs on schedule 6;
x7: # of RNs on schedule 7.
Objective function
Min salary: 550x1+625x2+625x3+625x4+625x5+575x6+500x7
Constraints
Sun: x2  x3  x4  x5  x6  22
Mon: x3  x4  x5  x6  x7  17
Tue: x1  x4  x5  x6  x7  13
Wed: x1  x2  x5  x6  x7  21
Thurs: x1  x2  x3  x6  x7  16
Fri: x1  x2  x3  x4  x7  14
Sat: x1  x2  x3  x4  x5  20
Nonnegativity: x1 , x2 ,..., x7 > 0

2. Blending problem:
Decision variables
x1: tons of ore from mine 1 in each ton of the blend
x2: tons of ore from mine 2 in each ton of the blend
x3: tons of ore from mine 3 in each ton of the blend
x4: tons of ore from mine 4 in each ton of the blend
Objective function
Min cost
Min 800x1+400x2+600x3+500x4
Constraints
Element A: 10 x1  3 x2  8 x3  2 x4  5
Element B: 90 x1  150 x2  75 x3  175 x4  100
Element C: 45 x1  25 x2  20 x3  37 x4  30
Weight: x1  x2  x3  x4  1
Nonegativity: x1 , x2 , x3 , x4  0

You might also like