Abstract

The square-root staffing model generates the number of servers s by summing the “offered load” k (minimum staffing level) and the “safety staff” (square root of k multiplied by the parameter β reflecting the desired service level). We treat the service level as one minus the delay probability (Erlang-C). Due to its iterative nature, we present a model for the Erlang-C which allows us to construct an approximate closed-form solution for the number of servers at the desired service level.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.