IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v38y2016i4d10.1007_s00291-015-0425-8.html
   My bibliography  Save this article

Coping with production time variability via dynamic lead-time quotation

Author

Listed:
  • Gökçe Kahveciog̃lu

    (Northwestern University)

  • Barış Balcıog̃lu

    (Sabancı University)

Abstract

In this paper, we propose two dynamic lead-time quotation policies in an M/GI/1 type make-to-stock queueing system serving lead-time sensitive customers with a single type of product. Incorporating non-exponential service times in an exact method for make-to-stock queues is usually deemed difficult. Our analysis of the proposed policies is exact and requires the numerical inversion of the Laplace transform of the sojourn time of an order to be placed. The first policy assures that the long-run probability of delivering the product within the quoted lead-time is the same for all backlogged customers. The second policy is a refinement of the first which improves the profitability if customers are oversensitive to even short delays in delivery. Numerical results show that both policies perform close to the optimal policy that was characterized only for exponential service times. The new insight gained is that the worsening impact of the production time variability, which is felt significantly in systems accepting all customers by quoting zero lead times, decreases when dynamic lead-time quotation policies are employed.

Suggested Citation

  • Gökçe Kahveciog̃lu & Barış Balcıog̃lu, 2016. "Coping with production time variability via dynamic lead-time quotation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 877-898, October.
    • Handle: RePEc:spr:orspec:v:38:y:2016:i:4:d:10.1007_s00291-015-0425-8
    DOI: 10.1007/s00291-015-0425-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-015-0425-8
    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-015-0425-8?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. Izak Duenyas & Wallace J. Hopp, 1995. "Quoting Customer Lead Times," Management Science, INFORMS, vol. 41(1), pages 43-57, January.
    2. Slotnick, Susan A. & Sobel, Matthew J., 2005. "Manufacturing lead-time rules: Customer retention versus tardiness costs," European Journal of Operational Research, Elsevier, vol. 163(3), pages 825-856, June.
    3. Ali Tamer Unal & Reha Uzsoy & Ali Kiran, 1997. "Rescheduling on a single machine with part-type dependent setup times and deadlines," Annals of Operations Research, Springer, vol. 70(0), pages 93-113, April.
    4. ElHafsi, Mohsen, 2000. "An operational decision model for lead-time and price quotation in congested manufacturing systems," European Journal of Operational Research, Elsevier, vol. 126(2), pages 355-370, October.
    5. Sabri Çelik & Costis Maglaras, 2008. "Dynamic Pricing and Lead-Time Quotation for a Multiclass Make-to-Order Queue," Management Science, INFORMS, vol. 54(6), pages 1132-1146, June.
    6. Dellaert, Nico P., 1991. "Due-date setting and production control," International Journal of Production Economics, Elsevier, vol. 23(1-3), pages 59-67, October.
    7. David L. Jagerman & Benjamin Melamed, 2003. "Models and Approximations for Call Center Design," Methodology and Computing in Applied Probability, Springer, vol. 5(2), pages 159-181, June.
    8. Wallace J. Hopp & Melanie Roof Sturgis, 2001. "A Simple, Robust Leadtime-Quoting Policy," Manufacturing & Service Operations Management, INFORMS, vol. 3(4), pages 321-336, April.
    9. Joseph Abate & Ward Whitt, 1995. "Numerical Inversion of Laplace Transforms of Probability Distributions," INFORMS Journal on Computing, INFORMS, vol. 7(1), pages 36-43, February.
    10. Roman Kapuscinski & Sridhar Tayur, 2007. "Reliable Due-Date Setting in a Capacitated MTO System with Two Customer Classes," Operations Research, INFORMS, vol. 55(1), pages 56-74, February.
    11. Lode Li, 1992. "The Role of Inventory in Delivery-Time Competition," Management Science, INFORMS, vol. 38(2), pages 182-197, February.
    12. Lin, Bertrand M. T., 2001. "Scheduling in the two-machine flowshop with due date constraints," International Journal of Production Economics, Elsevier, vol. 70(2), pages 117-123, March.
    13. So, Kut C. & Song, Jing-Sheng, 1998. "Price, delivery time guarantees and capacity selection," European Journal of Operational Research, Elsevier, vol. 111(1), pages 28-49, November.
    14. Sanajian, Nima & BalcIog[small tilde]lu, BarIs, 2009. "The impact of production time variability on make-to-stock queue performance," European Journal of Operational Research, Elsevier, vol. 194(3), pages 847-855, May.
    15. Mark L. Spearman & Rachel Q. Zhang, 1999. "Optimal Lead Time Policies," Management Science, INFORMS, vol. 45(2), pages 290-295, February.
    16. Lawrence M. Wein, 1991. "Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue," Management Science, INFORMS, vol. 37(7), pages 834-850, July.
    17. Pinar Keskinocak & R. Ravi & Sridhar Tayur, 2001. "Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues," Management Science, INFORMS, vol. 47(2), pages 264-279, February.
    18. Izak Duenyas, 1995. "Single Facility Due Date Setting with Multiple Customer Classes," Management Science, INFORMS, vol. 41(4), pages 608-619, April.
    19. Li, Jing-Wen, 2003. "Improving the performance of job shop manufacturing with demand-pull production control by reducing set-up/processing time variability," International Journal of Production Economics, Elsevier, vol. 84(3), pages 255-270, June.
    20. S. Rajagopalan, 2002. "Make to Order or Make to Stock: Model and Application," Management Science, INFORMS, vol. 48(2), pages 241-256, February.
    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. Seçil Savaşaneril & Paul M. Griffin & Pınar Keskinocak, 2010. "Dynamic Lead-Time Quotation for an M/M/1 Base-Stock Inventory Queue," Operations Research, INFORMS, vol. 58(2), pages 383-395, April.
    2. A. Baykal Hafızoğlu & Esma S. Gel & Pınar Keskinocak, 2016. "Price and Lead Time Quotation for Contract and Spot Customers," Operations Research, INFORMS, vol. 64(2), pages 406-415, April.
    3. Secil Savasaneril & Ece Sayin, 2017. "Dynamic lead time quotation under responsive inventory and multiple customer classes," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 95-135, January.
    4. Slotnick, Susan A. & Sobel, Matthew J., 2005. "Manufacturing lead-time rules: Customer retention versus tardiness costs," European Journal of Operational Research, Elsevier, vol. 163(3), pages 825-856, June.
    5. Kaman, Cumhur & Savasaneril, Secil & Serin, Yasemin, 2013. "Production and lead time quotation under imperfect shop floor information," International Journal of Production Economics, Elsevier, vol. 144(2), pages 422-431.
    6. Charnsirisakskul, Kasarin & Griffin, Paul M. & Keskinocak, Pinar, 2006. "Pricing and scheduling decisions with leadtime flexibility," European Journal of Operational Research, Elsevier, vol. 171(1), pages 153-169, May.
    7. Philipp Afèche & Opher Baron & Yoav Kerner, 2013. "Pricing Time-Sensitive Services Based on Realized Performance," Manufacturing & Service Operations Management, INFORMS, vol. 15(3), pages 492-506, July.
    8. Tanja Mlinar & Philippe Chevalier, 2016. "Pooling heterogeneous products for manufacturing environments," 4OR, Springer, vol. 14(2), pages 173-200, June.
    9. Weixin Shang & Liming Liu, 2011. "Promised Delivery Time and Capacity Games in Time-Based Competition," Management Science, INFORMS, vol. 57(3), pages 599-610, March.
    10. Barış Ata & Tava Lennon Olsen, 2009. "Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs," Operations Research, INFORMS, vol. 57(3), pages 753-768, June.
    11. Feng, Jiejian & Zhang, Michael, 2017. "Dynamic quotation of leadtime and price for a Make-To-Order system with multiple customer classes and perfect information on customer preferences," European Journal of Operational Research, Elsevier, vol. 258(1), pages 334-342.
    12. Erica L. Plambeck, 2004. "Optimal Leadtime Differentiation via Diffusion Approximations," Operations Research, INFORMS, vol. 52(2), pages 213-228, April.
    13. Jiejian Feng & Liming Liu & Xiaoming Liu, 2011. "TECHNICAL NOTE---An Optimal Policy for Joint Dynamic Price and Lead-Time Quotation," Operations Research, INFORMS, vol. 59(6), pages 1523-1527, December.
    14. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    15. Li, Xueping & Wang, Jiao & Sawhney, Rapinder, 2012. "Reinforcement learning for joint pricing, lead-time and scheduling decisions in make-to-order systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 99-109.
    16. Mor Armony & Erica Plambeck & Sridhar Seshadri, 2009. "Sensitivity of Optimal Capacity to Customer Impatience in an Unobservable M/M/S Queue (Why You Shouldn't Shout at the DMV)," Manufacturing & Service Operations Management, INFORMS, vol. 11(1), pages 19-32, June.
    17. Balcıõglu, Barış & Varol, Yãgız, 2022. "Fair and profitable: How pricing and lead-time quotation policies can help," European Journal of Operational Research, Elsevier, vol. 299(3), pages 977-986.
    18. Murat Erkoc & S. David Wu & Haresh Gurnani, 2008. "Delivery‐date and capacity management in a decentralized internal market," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(5), pages 390-405, August.
    19. Modarres, Mohammad & Sharifyazdi, Mehdi, 2009. "Revenue management approach to stochastic capacity allocation problem," European Journal of Operational Research, Elsevier, vol. 192(2), pages 442-459, January.
    20. Mustafa Akan & Barı ş Ata & Tava Olsen, 2012. "Congestion-Based Lead-Time Quotation for Heterogenous Customers with Convex-Concave Delay Costs: Optimality of a Cost-Balancing Policy Based on Convex Hull Functions," Operations Research, INFORMS, vol. 60(6), pages 1505-1519, 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:38:y:2016:i:4:d:10.1007_s00291-015-0425-8. 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.