Wichita's famous Sethi Restaurant is open 24 hours a day. Servers report for duty at 3 A.M., 7 A.M., 11 A.M., 3 P.M., 7 P.M., or 11 P.M., and each works an 8-hour shift. The following table shows the minimum number of workers needed during the 6 periods into which the day is divided: Decision vairable: X₁ = number of workers reporting for the start of working period i, where i = 1, 2, 3, 4, 5, or 6. Objective function: Minimize Z= Subject to: Owner Avanti Sethi's scheduling problem is to determine how many servers should report for work at the start of each time period in order to minimize the total staff required for one day's operation. (Hint: Let X; equal the number of servers beginning work in time period i, where i = 1, 2, 3, 4, 5, 6.) X₁ + X₂ + X3 + X4+ X5 + X6 + For all X, 20 212 ▼215 ▼≥10 ▼≥13 ▼24 ▼24 Period 1 2 3 4 5 6 Time 3 A.M. - 7 A.M. 7 A.M. - 11 A.M. 11 A.M. - 3 P.M. 3 P.M. - 7 P.M. 7 P.M. - 11 P.M. 11 P.M. - 3 A.M. (7 A.M. - 11 A.M.) (11 A.M. - 3 P.M.) (3 P.M. - 7 P.M.) Number of Servers Required 4 12 15 10 13 4 (7 P.M. - 11 P.M.) (11 P.M. - 3 A.M.) (3 A.M. - 7 A.M.)

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter4: Linear Programming Models
Section: Chapter Questions
Problem 111P
icon
Related questions
Question
100%
Wichita's famous Sethi Restaurant is open 24 hours a day. Servers report for duty at 3 A.M., 7 A.M., 11 A.M., 3 P.M., 7 P.M., or 11 P.M., and each works an 8-hour shift. The following table shows the
minimum number of workers needed during the 6 periods into which the day is divided:
Decision vairable:
X₁ = = number of workers reporting for the start of working period i, where i = 1, 2, 3, 4, 5, or 6.
Objective function:
Minimize Z =
Subject to:
Owner Avanti Sethi's scheduling problem is to determine how many servers should report for work at the start of each time period in order to minimize the total staff required for one day's operation.
(Hint: Let X; equal the number of servers beginning work in time period i, where i = 1, 2, 3, 4, 5, 6.)
X₁ +
X₂ +
X3 +
X4 +
X5 +
X6 +
For all X; ≥0
≥ 12
≥ 15
≥ 10
Period
1
2
3
4
5
6
≥13
≥4
≥4
Time
3 A.M. - 7 A.M.
7 A.M.
.- 11 A.M.
11 A.M. - 3 P.M.
3 P.M. - 7 P.M.
7 P.M. - 11 P.M.
11 P.M. - 3 A.M.
Number of Servers Required
4
12
15
10
13
4
(7 A.M. - 11 A.M.)
(11 A.M. - 3 P.M.)
(3 P.M. - 7 P.M.)
(7 P.M. - 11 P.M.)
(11 P.M. - 3 A.M.)
(3 A.M. - 7 A.M.)
Transcribed Image Text:Wichita's famous Sethi Restaurant is open 24 hours a day. Servers report for duty at 3 A.M., 7 A.M., 11 A.M., 3 P.M., 7 P.M., or 11 P.M., and each works an 8-hour shift. The following table shows the minimum number of workers needed during the 6 periods into which the day is divided: Decision vairable: X₁ = = number of workers reporting for the start of working period i, where i = 1, 2, 3, 4, 5, or 6. Objective function: Minimize Z = Subject to: Owner Avanti Sethi's scheduling problem is to determine how many servers should report for work at the start of each time period in order to minimize the total staff required for one day's operation. (Hint: Let X; equal the number of servers beginning work in time period i, where i = 1, 2, 3, 4, 5, 6.) X₁ + X₂ + X3 + X4 + X5 + X6 + For all X; ≥0 ≥ 12 ≥ 15 ≥ 10 Period 1 2 3 4 5 6 ≥13 ≥4 ≥4 Time 3 A.M. - 7 A.M. 7 A.M. .- 11 A.M. 11 A.M. - 3 P.M. 3 P.M. - 7 P.M. 7 P.M. - 11 P.M. 11 P.M. - 3 A.M. Number of Servers Required 4 12 15 10 13 4 (7 A.M. - 11 A.M.) (11 A.M. - 3 P.M.) (3 P.M. - 7 P.M.) (7 P.M. - 11 P.M.) (11 P.M. - 3 A.M.) (3 A.M. - 7 A.M.)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,