IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i6p1358-1372.html
   My bibliography  Save this article

Customer rejection to guide lead time quotation and pricing decisions

Author

Listed:
  • Ramzi Hammami
  • Yannick Frein
  • Abduh Sayid Albana

Abstract

The lead time (LT) quotation and pricing models in make-to-order environments usually assume that all arriving orders are accepted. Hence, despite the loss of demand, the firm must quote a relatively long LT to tackle the situations where there are too many waiting orders. This paper investigates the policy of accepting orders based on the state of the system and, consequently, rejecting customers when the number of waiting orders is larger than a given threshold value. Indeed, if there are less than K jobs in the system (K fixed), then the new order is accepted and a pair of LT and price are quoted to the customer. Otherwise, the order is rejected. Thus, we model the firm’s operations as a M/M/1/K queue instead of the commonly-used M/M/1 queue. We determine the optimal solution for K = 1 and solve the problem numerically for K ≥ 2. We show that our policy can be more profitable than the all-orders acceptance policy. We provide insights into when should a K be imposed and how such a K should be chosen. We find that the higher the sensitivity of demand to price or to LT is, the lower the optimal value of K.

Suggested Citation

  • Ramzi Hammami & Yannick Frein & Abduh Sayid Albana, 2021. "Customer rejection to guide lead time quotation and pricing decisions," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(6), pages 1358-1372, June.
  • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:6:p:1358-1372
    DOI: 10.1080/01605682.2020.1718556
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2020.1718556
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2020.1718556?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.

    Citations

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


    Cited by:

    1. Liu, Jian & Chen, Jian & Bo, Rui & Meng, Fanlin & Xu, Yong & Li, Peng, 2023. "Increases or discounts: Price strategies based on customers’ patience times," European Journal of Operational Research, Elsevier, vol. 305(2), pages 722-737.

    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:taf:tjorxx:v:72:y:2021:i:6:p:1358-1372. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.