Scribd
Upload
125 views

Linear Programming On Work Scheduling - Operations Management

The document discusses using linear programming to optimize worker scheduling at the Y.S. Chang Restaurant. It defines scheduling constraints and variables to minimize the total staff needed over a 24 hour period. The optimal solution is to employ 30 total workers, with 3 workers from 3-7am, 9 from 7-11am, 7 from 11am-3pm and 3-7pm each, 4 from 7-11pm, and none from 11pm-3am. This solution meets scheduling requirements with a surplus of 5 workers during the 3-7pm shift as a buffer for potential high demand.

Uploaded by

Rovic Ira Correos
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
125 views

Linear Programming On Work Scheduling - Operations Management

The document discusses using linear programming to optimize worker scheduling at the Y.S. Chang Restaurant. It defines scheduling constraints and variables to minimize the total staff needed over a 24 hour period. The optimal solution is to employ 30 total workers, with 3 workers from 3-7am, 9 from 7-11am, 7 from 11am-3pm and 3-7pm each, 4 from 7-11pm, and none from 11pm-3am. This solution meets scheduling requirements with a surplus of 5 workers during the 3-7pm shift as a buffer for potential high demand.

Uploaded by

Rovic Ira Correos
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Rovic Ira A.

Correos Mgt187 F – Operations Management


BS in Management III
Activity 4
Linear Programming

Applications of Linear Programming in Work Scheduling Problem


The famous Y. S. Chang Restaurant is open 24 hours a day. Waiters and busboys
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
six periods into which the day is divided. Chang’s scheduling problem is to determine how
many waiters and busboys should report for work at the start of each time period to minimize
the total staff required for one day’s operation. (Hint: Let Xi equal the number of waiters and
busboys beginning work in time period i, where i = 1, 2, 3, 4, 5, 6.)

Total workers = 55 required waiters and busboys


Table 1. Required number of workers per duty reporting schedule

Let Xi = the number of waiters and busboys beginning work in time period i,
where i = 1, 2, 3, 4, 5, 6
The number of waiters and their reporting times of work are detailed below:
X1 = waiters and busboys starting at 3 am (ending at 11 am)
X2 = waiters and busboys starting at 7 am (ending at 3 pm)
X3 = waiters and busboys starting at 11 am (ending at 7 pm)
X4 = waiters and busboys starting at 3 pm (ending at 11 pm)
X5 = waiters and busboys starting at 7 pm (ending at 3 am)
X6 = waiters and busboys starting at 11 pm (ending at 7 am)
Objective Function:
To minimize the total staff required for one day’s operation.

Constraints:
For every time period, the available number of waiters and busboys must be at least
equal to the required workers per work schedule.

X1 + X6 ≥3
X1 + X2 ≥ 12
X2 + X3 ≥ 16
X3 + X4 ≥9
X4 + X5 ≥ 11
X5 + X6 ≥4
Provided that,
X1, X2, X3, X4, X5, X6 ≥ 0

Solution Using Excel QM Solver


The restaurant work scheduling problem of Y.S. Chang are computed using the Excel
QM Solver given the six (6) constraints and five (5) variables which are addressed below:
Table 2. Constraint scheduling problem of Y.S. Chang

Table 3. Optimal solutions for ideal number of workers to hire and to assign in different
work schedules.

Inference on Optimal Workers to Hire or to Assign


The results posit that the Y.S. Chang management should employ approximately 30
workers needed to minimally satisfy the number of waiters and busboys required per work
period.
Furthermore, Y.S. Chang should employ three (3) waiters and busboys on 3 am to 7
am, nine (9) workers on 7 am to 11 am, seven (7) workers on 11 am to 3 pm and 3 pm to
7 pm respectively, four (4) workers on 7 pm to 11 pm, and no workers should be employed
on 11 pm to 3 am.
Hence, the required 55 workers to supply each time period was efficiently minimized
for better restaurant service flexibility.

Supplemental Inference

The suggested optimal work scheduling solution Y.S. Chang management should
employ posed a surplus of about five (5) employees in the 4th constraint or the 3 pm to 7
pm restaurant work schedule. This suggests that the restaurant optimally supplied more than
the required number of workers on that time period which serves as a safety net for the
management to cater presumption of high demand at that period.

You might also like