IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v55y2008i5p444-458.html
   My bibliography  Save this article

Scheduling and due‐date quotation in a make‐to‐order supply chain

Author

Listed:
  • Philip Kaminsky
  • Onur Kaya

Abstract

We consider a manufacturer, served by a single supplier, who has to quote due dates to arriving customers in a make‐to‐order production environment. The manufacturer is penalized for long lead times and for missing due dates. To meet due dates, the manufacturer has to obtain components from a supplier. We model this manufacturer and supplier as a two‐machine flow shop, consider several variations of this problem, and design effective due‐date quotation and scheduling algorithms for centralized and decentralized versions of the model. We perform extensive computational testing to assess the effectiveness of our algorithms and to compare the centralized and decentralized models to quantify the value of centralized control in a make‐to‐order supply chain. Since complete information exchange and centralized control is not always practical or cost‐effective, we explore the value of partial information exchange for this system. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:55:y:2008:i:5:p:444-458
    DOI: 10.1002/nav.20297
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20297
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20297?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. Izak Duenyas & Wallace J. Hopp, 1995. "Quoting Customer Lead Times," Management Science, INFORMS, vol. 41(1), pages 43-57, January.
    2. S. S. Panwalkar & M. L. Smith & A. Seidmann, 1982. "Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem," Operations Research, INFORMS, vol. 30(2), pages 391-399, April.
    3. Philip Kaminsky & David Simchi-Levi, 1998. "Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem," Operations Research, INFORMS, vol. 46(6), pages 872-882, December.
    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. Cathy H. Xia & George J. Shanthikumar & Peter W. Glynn, 2000. "On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem," Operations Research, INFORMS, vol. 48(4), pages 615-622, August.
    6. Philip Kaminsky, 2003. "The effectiveness of the longest delivery time rule for the flow shop delivery time problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(3), pages 257-272, April.
    7. Richard Loulou, 1984. "Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling," Mathematics of Operations Research, INFORMS, vol. 9(1), pages 142-150, February.
    8. 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.
    9. 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.
    10. Izak Duenyas, 1995. "Single Facility Due Date Setting with Multiple Customer Classes," Management Science, INFORMS, vol. 41(4), pages 608-619, April.
    11. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Liu, Zhixin & Lu, Liang & Qi, Xiangtong, 2020. "Price quotation for orders with different due dates," International Journal of Production Economics, Elsevier, vol. 220(C).
    2. Alexander Seitz & Martin Grunow, 2017. "Increasing accuracy and robustness of order promises," International Journal of Production Research, Taylor & Francis Journals, vol. 55(3), pages 656-670, February.

    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. Zhi-Long Chen, 1997. "Scheduling with batch setup times and earliness-tardiness penalties," European Journal of Operational Research, Elsevier, vol. 96(3), pages 518-537, February.
    2. Lin, Shih-Wei & Chou, Shuo-Yan & Ying, Kuo-Ching, 2007. "A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1294-1301, March.
    3. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    4. 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.
    5. Chen, Zhi-Long, 1996. "Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs," European Journal of Operational Research, Elsevier, vol. 93(1), pages 49-60, August.
    6. Sang, Yao-Wen & Wang, Jun-Qiang & Sterna, Małgorzata & Błażewicz, Jacek, 2023. "Single machine scheduling with due date assignment to minimize the total weighted lead time penalty and late work," Omega, Elsevier, vol. 121(C).
    7. Oğuzhan Ahmet Arik, 2023. "A heuristic for single machine common due date assignment problem with different earliness/tardiness weights," OPSEARCH, Springer;Operational Research Society of India, vol. 60(3), pages 1561-1574, September.
    8. 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.
    9. 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.
    10. Tanja Mlinar & Philippe Chevalier, 2016. "Pooling heterogeneous products for manufacturing environments," 4OR, Springer, vol. 14(2), pages 173-200, June.
    11. 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.
    12. Shabtay, Dvir & Mosheiov, Gur & Oron, Daniel, 2022. "Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work," European Journal of Operational Research, Elsevier, vol. 303(1), pages 66-77.
    13. 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.
    14. Chevalier, Philippe & Lamas, Alejandro & Lu, Liang & Mlinar, Tanja, 2015. "Revenue management for operations with urgent orders," European Journal of Operational Research, Elsevier, vol. 240(2), pages 476-487.
    15. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    16. Erica L. Plambeck, 2004. "Optimal Leadtime Differentiation via Diffusion Approximations," Operations Research, INFORMS, vol. 52(2), pages 213-228, April.
    17. Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
    18. 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.
    19. 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.
    20. 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.

    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:wly:navres:v:55:y:2008:i:5:p:444-458. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.