IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v27y2014i1d10.1007_s10878-012-9502-y.html
   My bibliography  Save this article

Competitive analysis for make-to-order scheduling with reliable lead time quotation

Author

Listed:
  • Feifeng Zheng

    (Donghua University
    State Key Lab for Manufacturing Systems Engineering)

  • E. Zhang

    (Shanghai University of Finance and Economics)

  • Yinfeng Xu

    (Xi’an Jiaotong University
    State Key Lab for Manufacturing Systems Engineering)

  • Wei-Chiang Hong

    (Oriental Institute of Technology)

Abstract

This paper makes extended studies on the discrete problem of online scheduling and reliable lead time quotation (discrete Q-SLTQ) introduced by Keskinocak et al. (Manag. Sci. 47(2):264–279, 2001). We first relax the assumption on revenue function from a linear decreasing function to any decreasing function. We present an online deterministic strategy which is optimal in competitiveness for concave revenue functions. The above results are further extended to the continuous Q-SLTQ model where orders are released at arbitrary time points. For the discrete Q-SLTQ problem, if orders are with nonuniform lengths, we prove the nonexistence of online strategies with bounded competitive ratios; otherwise if orders are with unit length but various weights, we present an optimal online strategy.

Suggested Citation

  • Feifeng Zheng & E. Zhang & Yinfeng Xu & Wei-Chiang Hong, 2014. "Competitive analysis for make-to-order scheduling with reliable lead time quotation," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 182-198, January.
    • Handle: RePEc:spr:jcomop:v:27:y:2014:i:1:d:10.1007_s10878-012-9502-y
    DOI: 10.1007/s10878-012-9502-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9502-y
    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/s10878-012-9502-y?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. 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.
    4. Nicholas G. Hall & Wieslaw Kubiak & Suresh P. Sethi, 1991. "Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 847-856, October.
    5. 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.
    6. Nicholas G. Hall & Marc E. Posner, 1991. "Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 836-846, October.
    7. 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.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Altendorfer, Klaus & Minner, Stefan, 2015. "Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times," European Journal of Operational Research, Elsevier, vol. 243(2), pages 555-565.
    6. 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.
    7. Dvir Shabtay & George Steiner, 2008. "The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times," Annals of Operations Research, Springer, vol. 159(1), pages 25-40, March.
    8. Jin, Xianfei & Li, Kunpeng & Sivakumar, Appa Iyer, 2013. "Scheduling and optimal delivery time quotation for customers with time sensitive demand," International Journal of Production Economics, Elsevier, vol. 145(1), pages 349-358.
    9. 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.
    10. Slotnick, Susan A., 2011. "Optimal and heuristic lead-time quotation for an integrated steel mill with a minimum batch size," European Journal of Operational Research, Elsevier, vol. 210(3), pages 527-536, May.
    11. 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.
    12. X. Cai & F. S. Tu, 1996. "Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early‐tardy penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1127-1146, December.
    13. A. Baykal Hafızoğlu & Esma S. Gel & Pınar Keskinocak, 2013. "Expected Tardiness Computations in Multiclass Priority M / M / c Queues," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 364-376, May.
    14. Li, Y. & Ip, W. H. & Wang, D. W., 1998. "Genetic algorithm approach to earliness and tardiness production scheduling and planning problem," International Journal of Production Economics, Elsevier, vol. 54(1), pages 65-76, January.
    15. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    16. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    17. Ali Kordmostafapour & Javad Rezaeian & Iraj Mahdavi & Mahdi Yar Farjad, 2022. "Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1438-1470, December.
    18. Chung‐Lun Li & Edward C. Sewell & T. C. E. Cheng, 1995. "Scheduling to minimize release‐time resource consumption and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 949-966, September.
    19. Cai, X. & Lum, V. Y. S. & Chan, J. M. T., 1997. "Scheduling about a common due date with kob-dependent asymmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 98(1), pages 154-168, April.
    20. Tanja Mlinar & Philippe Chevalier, 2016. "Pooling heterogeneous products for manufacturing environments," 4OR, Springer, vol. 14(2), pages 173-200, June.

    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:jcomop:v:27:y:2014:i:1:d:10.1007_s10878-012-9502-y. 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.