IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v44y2022i4d10.1007_s00291-022-00684-x.html
   My bibliography  Save this article

Synchronous resource allocation: modeling, capacity, and optimization

Author

Listed:
  • Sigrún Andradóttir

    (Georgia Institute of Technology)

  • Hayriye Ayhan

    (Georgia Institute of Technology)

  • Douglas G. Down

    (McMaster University)

Abstract

We explore settings where it is necessary (due to physical or operational constraints) or desirable (due to synergies or ease of implementation) to assign resources to tasks in a synchronous manner. We model the system as a queueing network with flexible servers and introduce the notion of a configuration to address the synchronous assignment of servers. This allows for a unified approach to determine the effects of resource synchronization, covering a wide range of problems in the literature. The maximal capacity of the system is given by the solution of a linear programming problem that also provides the optimal fractions of time the servers should spend in different configurations. This is used as a basis for constructing policies that have capacity arbitrarily close to the maximal capacity. We contrast synchronous server assignment with an asynchronous approach (focusing on independently scheduling individual servers rather than configurations) and show that synchronous server assignment is attractive with respect to applicability (it can capture constraints on server assignment and synergies among servers), implementation (it may have significantly fewer combinations of server allocations), and capacity (when both are applicable, asynchronous and synchronous server assignment will yield the same maximal capacity). Finally, we illustrate our modeling framework using several examples.

Suggested Citation

  • Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2022. "Synchronous resource allocation: modeling, capacity, and optimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1287-1310, December.
    • Handle: RePEc:spr:orspec:v:44:y:2022:i:4:d:10.1007_s00291-022-00684-x
    DOI: 10.1007/s00291-022-00684-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-022-00684-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00291-022-00684-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Down, Douglas G. & Karakostas, George, 2008. "Maximizing throughput in queueing networks with limited flexibility," European Journal of Operational Research, Elsevier, vol. 187(1), pages 98-112, May.
    2. Jaakko Peltokorpi & Henri Tokola & Esko Niemi, 2015. "Worker coordination policies in parallel station systems: performance models for a set of jobs and for continuous arrival of jobs," International Journal of Production Research, Taylor & Francis Journals, vol. 53(6), pages 1625-1641, March.
    3. Alexandre Mas & Enrico Moretti, 2009. "Peers at Work," American Economic Review, American Economic Association, vol. 99(1), pages 112-145, March.
    4. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2007. "Compensating for Failures with Flexible Servers," Operations Research, INFORMS, vol. 55(4), pages 753-768, August.
    5. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2003. "Dynamic Server Allocation for Queueing Networks with Flexible Servers," Operations Research, INFORMS, vol. 51(6), pages 952-968, December.
    6. J. G. Dai & Wuqin Lin, 2005. "Maximum Pressure Policies in Stochastic Processing Networks," Operations Research, INFORMS, vol. 53(2), pages 197-218, April.
    7. Kenneth L. Schultz & Tobias Schoenherr & David Nembhard, 2010. "An Example and a Proposal Concerning the Correlation of Worker Processing Times in Parallel Tasks," Management Science, INFORMS, vol. 56(1), pages 176-191, January.
    8. William C. Jordan & Stephen C. Graves, 1995. "Principles on the Benefits of Manufacturing Process Flexibility," Management Science, INFORMS, vol. 41(4), pages 577-594, April.
    9. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2011. "TECHNICAL NOTE---Queueing Systems with Synergistic Servers," Operations Research, INFORMS, vol. 59(3), pages 772-780, June.
    10. Itay Gurvich & Ward Whitt, 2009. "Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 237-253, June.
    11. Hyun-Soo Ahn & Mark E. Lewis, 2013. "Flexible Server Allocation and Customer Routing Policies for Two Parallel Queues When Service Rates Are Not Additive," Operations Research, INFORMS, vol. 61(2), pages 344-358, April.
    12. Suri Gurumurthi & Saif Benjaafar, 2004. "Modeling and analysis of flexible queueing systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(5), pages 755-782, August.
    13. Masha Shunko & Julie Niederhoff & Yaroslav Rosokha, 2018. "Humans Are Not Machines: The Behavioral Impact of Queueing Design on Service Time," Management Science, INFORMS, vol. 64(1), pages 453-473, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cong Shi & Yehua Wei & Yuan Zhong, 2019. "Process Flexibility for Multiperiod Production Systems," Operations Research, INFORMS, vol. 67(5), pages 1300-1320, September.
    2. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2007. "Compensating for Failures with Flexible Servers," Operations Research, INFORMS, vol. 55(4), pages 753-768, August.
    3. Eser Kırkızlar & Sigrún Andradóttir & Hayriye Ayhan, 2010. "Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(6), pages 563-582, September.
    4. Eser Kırkızlar & Sigrún Andradóttir & Hayriye Ayhan, 2012. "Flexible Servers in Understaffed Tandem Lines," Production and Operations Management, Production and Operations Management Society, vol. 21(4), pages 761-777, July.
    5. Naumov, Valeriy & Martikainen, Olli, 2011. "Method for Throughput Maximization of Multiclass Networks with Flexible Servers," Discussion Papers 1261, The Research Institute of the Finnish Economy.
    6. Down, Douglas G. & Karakostas, George, 2008. "Maximizing throughput in queueing networks with limited flexibility," European Journal of Operational Research, Elsevier, vol. 187(1), pages 98-112, May.
    7. Naumov, Valeriy & Martikainen, Olli, 2011. "Optimal Resource Allocation in Multiclass Networks," Discussion Papers 1262, The Research Institute of the Finnish Economy.
    8. Masha Shunko & Julie Niederhoff & Yaroslav Rosokha, 2018. "Humans Are Not Machines: The Behavioral Impact of Queueing Design on Service Time," Management Science, INFORMS, vol. 64(1), pages 453-473, January.
    9. Emmett J. Lodree & Nezih Altay & Robert A. Cook, 2019. "Staff assignment policies for a mass casualty event queuing network," Annals of Operations Research, Springer, vol. 283(1), pages 411-442, December.
    10. Kim, Nayeon & Montreuil, Benoit & Klibi, Walid & Zied Babai, M., 2023. "Network inventory deployment for responsive fulfillment," International Journal of Production Economics, Elsevier, vol. 255(C).
    11. Delasay, Mohammad & Ingolfsson, Armann & Kolfal, Bora & Schultz, Kenneth, 2019. "Load effect on service times," European Journal of Operational Research, Elsevier, vol. 279(3), pages 673-686.
    12. Tanja Mlinar & Philippe Chevalier, 2016. "Pooling heterogeneous products for manufacturing environments," 4OR, Springer, vol. 14(2), pages 173-200, June.
    13. Timothy C. Y. Chan & Douglas Fearing, 2019. "Process Flexibility in Baseball: The Value of Positional Flexibility," Management Science, INFORMS, vol. 65(4), pages 1642-1666, April.
    14. Zhao, Yaping & Xu, Xiaoyun & Li, Haidong & Liu, Yanni, 2016. "Prioritized customer order scheduling to maximize throughput," European Journal of Operational Research, Elsevier, vol. 255(2), pages 345-356.
    15. David Simchi-Levi & Yehua Wei, 2012. "Understanding the Performance of the Long Chain and Sparse Designs in Process Flexibility," Operations Research, INFORMS, vol. 60(5), pages 1125-1141, October.
    16. Mabel C. Chou & Geoffrey A. Chua & Huan Zheng, 2014. "On the Performance of Sparse Process Structures in Partial Postponement Production Systems," Operations Research, INFORMS, vol. 62(2), pages 348-365, April.
    17. Vijay Mehrotra & Kevin Ross & Geoff Ryder & Yong-Pin Zhou, 2012. "Routing to Manage Resolution and Waiting Time in Call Centers with Heterogeneous Servers," Manufacturing & Service Operations Management, INFORMS, vol. 14(1), pages 66-81, January.
    18. Arash Asadpour & Xuan Wang & Jiawei Zhang, 2020. "Online Resource Allocation with Limited Flexibility," Management Science, INFORMS, vol. 66(2), pages 642-666, February.
    19. Timothy C. Y. Chan & Daniel Letourneau & Benjamin G. Potter, 2022. "Sparse flexible design: a machine learning approach," Flexible Services and Manufacturing Journal, Springer, vol. 34(4), pages 1066-1116, December.
    20. Yin-Chi Chan & Eric W. M. Wong & Gavin Joynt & Paul Lai & Moshe Zukerman, 2018. "Overflow models for the admission of intensive care patients," Health Care Management Science, Springer, vol. 21(4), pages 554-572, December.

    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:spr:orspec:v:44:y:2022:i:4:d:10.1007_s00291-022-00684-x. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.