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

Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues

Author

Listed:
  • Pinar Keskinocak

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205)

  • R. Ravi

    (Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

  • Sridhar Tayur

    (Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

Abstract

Motivated by applications in the manufacturing and service industries, we consider two models for coordinating scheduling with lead-time quotation: a basic model with a single customer type, and an enhanced model where an additional second customer type expects immediate service or production. In both models, revenues obtained from the customers are sensitive to the lead time, there is a threshold of lead time above which the customer does not place an order, and the quoted lead times are 100% reliable. These models are related to well-known scheduling problems, which have been studied in both offline and online settings. We introduce the immediate quotation case and study it with the (traditional) online version. We provide complexity results for the offline case, and perform competitive analysis for the online cases. A natural question of bridging the gap between the online and quotation models leads us to the delayed quotation model, which we study briefly. The analysis of these models provides useful qualitative insights as well.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ormnsc:v:47:y:2001:i:2:p:264-279
    DOI: 10.1287/mnsc.47.2.264.9836
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. James K. Weeks, 1979. "A Simulation Study of Predictable Due-Dates," Management Science, INFORMS, vol. 25(4), pages 363-373, April.
    2. J. W. M. Bertrand, 1983. "The Effect of Workload Dependent Due-Dates on Job Shop Performance," Management Science, INFORMS, vol. 29(7), pages 799-816, July.
    3. Cheng, T. C. E. & Gupta, M. C., 1989. "Survey of scheduling research involving due date determination decisions," European Journal of Operational Research, Elsevier, vol. 38(2), pages 156-166, January.
    4. Izak Duenyas, 1995. "Single Facility Due Date Setting with Multiple Customer Classes," Management Science, INFORMS, vol. 41(4), pages 608-619, April.
    5. Hall, Nicholas G. & Magazine, Michael J., 1994. "Maximizing the value of a space mission," European Journal of Operational Research, Elsevier, vol. 78(2), pages 224-241, October.
    6. Kenneth R. Baker, 1984. "Sequencing Rules and Due-Date Assignments in a Job Shop," Management Science, INFORMS, vol. 30(9), pages 1093-1104, September.
    7. Suresh Chand & Dilip Chhajed, 1992. "A Single Machine Model for Determination of Optimal Due Dates and Sequence," Operations Research, INFORMS, vol. 40(3), pages 596-602, June.
    8. Abraham Seidmann & Milton L. Smith, 1981. "Due Date Assignment for Production Systems," Management Science, INFORMS, vol. 27(5), pages 571-581, May.
    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. 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.
    2. Mark L. Spearman & Rachel Q. Zhang, 1999. "Optimal Lead Time Policies," Management Science, INFORMS, vol. 45(2), pages 290-295, February.
    3. Enns, S. T., 1998. "Lead time selection and the behaviour of work flow in job shops," European Journal of Operational Research, Elsevier, vol. 109(1), pages 122-136, August.
    4. Erica L. Plambeck, 2004. "Optimal Leadtime Differentiation via Diffusion Approximations," Operations Research, INFORMS, vol. 52(2), pages 213-228, April.
    5. 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.
    6. Nekoiemehr, Nooshin & Zhang, Guoqing & Selvarajah, Esaignani, 2019. "Due date quotation in a dual-channel supply chain," International Journal of Production Economics, Elsevier, vol. 215(C), pages 102-111.
    7. Kedar S. Naphade & S. David Wu & Robert H. Storer & Bhavin J. Doshi, 2001. "Melt Scheduling to Trade Off Material Waste and Shipping Performance," Operations Research, INFORMS, vol. 49(5), pages 629-645, October.
    8. Bertrand, J. W. M. & van Ooijen, H. P. G., 2000. "Customer order lead times for production based on lead time and tardiness costs," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 257-265, March.
    9. 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.
    10. Raaymakers, W. H. M. & Weijters, A. J. M. M., 2003. "Makespan estimation in batch process industries: A comparison between regression analysis and neural networks," European Journal of Operational Research, Elsevier, vol. 145(1), pages 14-30, February.
    11. Philip Kaminsky & Onur Kaya, 2008. "Scheduling and due‐date quotation in a make‐to‐order supply chain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(5), pages 444-458, August.
    12. Sabuncuoglu, I. & Comlekci, A., 2002. "Operation-based flowtime estimation in a dynamic job shop," Omega, Elsevier, vol. 30(6), pages 423-442, December.
    13. 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.
    14. H.M. Raaymakers, Wenny & Will M. Bertrand, J. & C. Fransoo, Jan, 2001. "Makespan estimation in batch process industries using aggregate resource and job set characteristics," International Journal of Production Economics, Elsevier, vol. 70(2), pages 145-161, March.
    15. Watanapa, Bunthit & Techanitisawad, Anulark, 2005. "Simultaneous price and due date settings for multiple customer classes," European Journal of Operational Research, Elsevier, vol. 166(2), pages 351-368, October.
    16. Ozturk, Atakan & Kayaligil, Sinan & Ozdemirel, Nur E., 2006. "Manufacturing lead time estimation using data mining," European Journal of Operational Research, Elsevier, vol. 173(2), pages 683-700, September.
    17. Raaymakers, Wenny H. M. & Fransoo, Jan C., 2000. "Identification of aggregate resource and job set characteristics for predicting job set makespan in batch process industries," International Journal of Production Economics, Elsevier, vol. 68(2), pages 137-149, November.
    18. He, Zesheng & Yang, Taeyong & Tiger, Andy, 1996. "An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling," European Journal of Operational Research, Elsevier, vol. 91(1), pages 99-117, May.
    19. Easton, Fred F. & Moodie, Douglas R., 1999. "Pricing and lead time decisions for make-to-order firms with contingent orders," European Journal of Operational Research, Elsevier, vol. 116(2), pages 305-318, July.
    20. Song, D. P. & Hicks, C. & Earl, C. F., 2002. "Product due date assignment for complex assemblies," International Journal of Production Economics, Elsevier, vol. 76(3), pages 243-256, April.

    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:47:y:2001:i:2:p:264-279. 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: 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.