Linear Programming: Work Scheduling Example 2

preview_player
Показать описание
Example 2: A private security firm has different requirements for each 4 hour shift. The firm requires the following number of security guards for each 4 hour shift: 12am to 4am - 10, 4 to 8am- 8, 8am to 12pm- 8, 12pm to 4pm - 7, 4pm to 8pm - 6, 8pm to 12am - 5. A security guard can only work two shifts in a row on any given day. Formulate an LP that can be used to minimize the number of workers needed to meet the security firms daily requirements.
Рекомендации по теме
Комментарии
Автор

This is cool and all, but I don't see how this "can be used to minimize the number" of anything, as it's just a self-referential list of constraints. How does one break out of the loop to arrive at an actual number?

mallninja
Автор

Can you explain why you chose the shift to start at X6? Was the starting shift chosen arbitrarily?

joylm