IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v34y1988i5p666-671.html
   My bibliography  Save this article

Note---Optimal Pricing Policy for the Service Facility Offering a Set of Priority Prices

Author

Listed:
  • Hanna Alperstein

    (Faculty of Management, Tel Aviv University, Tel Aviv 69978, Israel)

Abstract

A profit making service facility that offers a set of different prices for the single service it provides is considered. By paying a higher price, the customer buys into a priority class that shortens his stay in the service system. We determine the optimal number of priority classes and the set of prices that affords the service facility a higher revenue than any other set. Relying on Adiri and Yechiali (Adiri, I., U. Yechiali. 1974. Optimal priority-purchasing and pricing decisions in non monopoly and monopoly queues. Oper. Res. 22 1051--1066.) who demonstrated that the customers' optimal priority-purchasing strategy is of the control limit type, we prove that for every set of M(>1) priority prices that are optimal to the service facility, the control limits of all priority classes equal one except the control limit of the highest priority class that is determined by the parameters of the system. We show that the highest priority class also has a control limit of one when the service facility uses the optimal M and optimal priority prices. Thus full optimality results in implementation of the pure LIFO (Last-In-First-Out) service discipline.

Suggested Citation

  • Hanna Alperstein, 1988. "Note---Optimal Pricing Policy for the Service Facility Offering a Set of Priority Prices," Management Science, INFORMS, vol. 34(5), pages 666-671, May.
    • Handle: RePEc:inm:ormnsc:v:34:y:1988:i:5:p:666-671
    DOI: 10.1287/mnsc.34.5.666
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.34.5.666
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.34.5.666?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Refael Hassin, 2022. "Profit maximization and cost balancing in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 429-431, April.
    2. Radhakrishnan, Suresh & Balachandran, Kashi R., 1995. "Stochastic choice hazard and incentives in a common service facility," European Journal of Operational Research, Elsevier, vol. 81(2), pages 324-335, March.
    3. Moshe Haviv & Binyamin Oz, 2018. "Self-Regulation of an Unobservable Queue," Management Science, INFORMS, vol. 64(5), pages 2380-2389, May.
    4. Moshe Haviv & Binyamin Oz, 2015. "Regulating an observable M/M/1 queue," Discussion Paper Series dp691, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    5. Zhongbin Wang & Luyi Yang & Shiliang Cui & Jinting Wang, 2021. "In-queue priority purchase: a dynamic game approach," Queueing Systems: Theory and Applications, Springer, vol. 97(3), pages 343-381, April.
    6. Cary Deck & Erik O Kimbrough & Steeve Mongrain, 2014. "Paying for Express Checkout: Competition and Price Discrimination in Multi-Server Queuing Systems," PLOS ONE, Public Library of Science, vol. 9(3), pages 1-13, March.
    7. Warsing, Donald P. & Souza, Gilvan C. & Greis, Noel P., 2001. "Determining the value of dedicated multimodal cargo facilities in a multi-region distribution network," European Journal of Operational Research, Elsevier, vol. 133(1), pages 81-93, August.

    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:inm:ormnsc:v:34:y:1988:i:5:p:666-671. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.