IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v330y2026i3p1009-1027.html

Share or not share capacity? Target customer type in batch service queue systems

Author

Listed:
  • Li, Kenan
  • Lian, Zhaotong
  • Li, Xin

Abstract

This study examines the behaviour of two service companies under the M/M[n]/1 batch service queueing model, which divides their customers into brand-loyal and searching categories. Our research indicates that when market conditions are highly competitive and the rewards for different types of customers are similar, these firms primarily cater to brand-loyal customers in very large or very small markets. However, when the market is moderate, they expand their customer base to include all types. It is worth noting that as the difference in rewards between customer groups increases, these firms focus exclusively on brand-loyal customers. In co-opetition, where both companies provide similar services, they aggressively cut prices to attract searching customers. This fierce price competition ultimately drives prices down to marginal cost levels, eliminating the possibility of profit and compelling a strategic pivot back to prioritizing brand-loyal customers. Our research indicates that under co-opetition, firms are more likely to achieve higher revenues in extremely large or small markets. In contrast, in competitive settings, firms tend to secure greater profitability in markets that maintain specific proportions of brand-loyal customers.

Suggested Citation

  • Li, Kenan & Lian, Zhaotong & Li, Xin, 2026. "Share or not share capacity? Target customer type in batch service queue systems," European Journal of Operational Research, Elsevier, vol. 330(3), pages 1009-1027.
  • Handle: RePEc:eee:ejores:v:330:y:2026:i:3:p:1009-1027
    DOI: 10.1016/j.ejor.2025.08.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725006289
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2025.08.012?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:eee:ejores:v:330:y:2026:i:3:p:1009-1027. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.