0% found this document useful (0 votes)
57 views1 page

Problem 8.3

The document outlines a scheduling optimization problem for a restaurant to determine the minimum number of staff needed across six time periods each day. It defines decision variables to represent the number of staff scheduled for each period and constraints to ensure adequate coverage. The objective is to minimize the total staff hours by determining the optimal values for the decision variables while satisfying the constraints.

Uploaded by

Charlie R
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
57 views1 page

Problem 8.3

The document outlines a scheduling optimization problem for a restaurant to determine the minimum number of staff needed across six time periods each day. It defines decision variables to represent the number of staff scheduled for each period and constraints to ensure adequate coverage. The objective is to minimize the total staff hours by determining the optimal values for the decision variables while satisfying the constraints.

Uploaded by

Charlie R
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd

NUMBER WIATERS

PERIOD TIME AND BUSBOY REQUIRED


1 3AM - 7 AM 3
2 7 AM - 11 AM 12
3 11 AM - 3 PM 16
4 3 PM - 7 PM 9
5 7 PM - 11 PM 11
6 11 PM - 3 AM 4

Decision variables
X1= 3AM - 7 AM schedule 1
X2= 7 AM - 11 AM schedule 2
X3= 11 AM - 3 PM schedule 3
X4= 3 PM - 7 PM schedule 4
X5= 7 PM - 11 PM schedule 5
X6= 11 PM - 3 AM schedule 6

Objective function
Minimize the hours
X1 + X2 + X3 + X4 + X5 + X6 Minumun staff possible
Subject to: Constraint 1 X1 + X > 3 schedule 1
Constraint 2 X1 + X2 > 12 schedule 2
Constraint 3 X2 + X3 > 16 schedule 3
Constraint 4 X3 + X4 > 9 schedule 4
Constraint 5 X4 + X5 > 11 schedule 5
Constraint 6 X5 + X > 4 schedule 6
X1, X2,X3,X4,X5,X6 > 0 non negative

X1 X2 X3 X4 X5 X6
3 AM - 7 AM 7 AM - 11 AM 11 AM - 3 PM 3 PM - 7 PM 7 PM - 11 PM 11 PM - 3 AM
Variable 0 16 0 10 1 3
Min staff Needed 3 12 16 9 11 4 305

Constraints LHS RHS


3 AM - 7 AM 1 0 0 0 0 1 3 ≥ 3
7 AM - 11 AM 1 1 0 0 0 0 16 ≥ 12
11 AM - 3 PM 0 1 1 0 0 0 16 ≥ 16
3 PM - 7 PM 0 0 1 1 0 0 10 ≥ 9
7 PM - 11 PM 0 0 0 1 1 0 11 ≥ 11
11 PM - 3 AM 0 0 0 0 1 1 4 ≥ 4

Schedule Staff
X1 3AM - 7 AM 0
X2 7 AM - 11 AM 16
X3 11 AM - 3 PM 0
X4 3 PM - 7 PM 10
X5 7 PM - 11 PM 1
X6 11 PM - 3 AM 3

Minum required 305

You might also like