IDEAS home Printed from https://ideas.repec.org/a/igg/jwsr00/v18y2021i3p1-21.html
   My bibliography  Save this article

Bottleneck-Aware Resource Allocation for Service Processes: A New Max-Min Approach

Author

Listed:
  • Shoulu Hou

    (Beijing Information Science and Technology University, China)

  • Wei Ni

    (CSIRO, Australia)

  • Ming Wang

    (University of International Business and Economics, China)

  • Xiulei Liu

    (Beijing Information Science and Technology University, China)

  • Qiang Tong

    (Beijing Information Science and Technology University, China)

  • Shiping Chen

    (CSIRO, Australia)

Abstract

In 5G systems and beyond, traditional generic service models are no longer appropriate for highly customized and intelligent services. The process of reinventing service models involves allocating available resources, where the performance of service processes is determined by the activity node with the lowest service rate. This paper proposes a new bottleneck-aware resource allocation approach by formulating the resource allocation as a max-min problem. The approach can allocate resources proportional to the workload of each activity, which can guarantee that the service rates of activities within a process are equal or close-to-equal. Based on the business process simulator (i.e., BIMP) simulation results show that the approach is able to reduce the average cycle time and improve resource utilization, as compared to existing alternatives. The results also show that the approach can effectively mitigate the impact of bottleneck activity on the performance of service processes.

Suggested Citation

  • Shoulu Hou & Wei Ni & Ming Wang & Xiulei Liu & Qiang Tong & Shiping Chen, 2021. "Bottleneck-Aware Resource Allocation for Service Processes: A New Max-Min Approach," International Journal of Web Services Research (IJWSR), IGI Global, vol. 18(3), pages 1-21, July.
  • Handle: RePEc:igg:jwsr00:v:18:y:2021:i:3:p:1-21
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJWSR.2021070101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jwsr00:v:18:y:2021:i:3:p:1-21. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.