IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v220y2020ics0925527319302580.html
   My bibliography  Save this article

Price quotation for orders with different due dates

Author

Listed:
  • Liu, Zhixin
  • Lu, Liang
  • Qi, Xiangtong

Abstract

Pricing has been broadly used as an effective tool for companies to control demand. In most operations management models, the demand quantity of a product is formulated as a function of price, which garners the company flexibility to obtain tradeoff between revenue and cost. Such a price-demand function may not be suitable for make-to-order products with heterogeneous demands. To address such an issue, we study the price quotation and scheduling problem for a set of order inquiries. Specifically, a manufacturer receives multiple order inquiries from customers, and needs to quote a price for each inquiry. The quoted price will affect the probability of which the customer will accept the price and confirm the order. Then the manufacturer determines a schedule for processing the confirmed orders. The objective of the manufacturer is to maximize the expected profit, i.e., the total revenue from all confirmed orders less the delay penalty incurred by some orders. We show that the problem is NP-hard, design a heuristic to determine price quotes, and propose a method to find an upper bound of the optimal objective value. The efficiency of our heuristic is evaluated computationally. In general, our heuristic performs weaker with tighter due date, greater scheduling cost relative to order price, and nonlinear relationship between price quote and order placement probability.

Suggested Citation

  • Liu, Zhixin & Lu, Liang & Qi, Xiangtong, 2020. "Price quotation for orders with different due dates," International Journal of Production Economics, Elsevier, vol. 220(C).
  • Handle: RePEc:eee:proeco:v:220:y:2020:i:c:s0925527319302580
    DOI: 10.1016/j.ijpe.2019.07.021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527319302580
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ijpe.2019.07.021?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. 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.
    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. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    4. Nicholas G. Hall & Marc E. Posner, 2001. "Generating Experimental Data for Computational Testing with Machine Scheduling Applications," Operations Research, INFORMS, vol. 49(6), pages 854-865, December.
    5. Zhixin Liu & Liang Lu & Xiangtong Qi, 2012. "Simultaneous and sequential price quotations for uncertain order inquiries with production scheduling cost," IISE Transactions, Taylor & Francis Journals, vol. 44(10), pages 820-833.
    6. Liang Lu & Zhixin Liu & Xiangtong Qi, 2013. "Coordinated price quotation and production scheduling for uncertain order inquiries," IISE Transactions, Taylor & Francis Journals, vol. 45(12), pages 1293-1308.
    7. Lei, Deming & Guo, Xiuping, 2015. "A parallel neighborhood search for order acceptance and scheduling in flow shop environment," International Journal of Production Economics, Elsevier, vol. 165(C), pages 12-18.
    8. Zhi-Long Chen & Nicholas G. Hall, 2010. "The Coordination of Pricing and Scheduling Decisions," Manufacturing & Service Operations Management, INFORMS, vol. 12(1), pages 77-92, April.
    9. Jianzhong Du & Joseph Y.-T. Leung, 1990. "Minimizing Total Tardiness on One Machine is NP-Hard," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 483-495, August.
    10. Qing Yue & Zhi-Long Chen & Guohua Wan, 2019. "Integrated pricing and production scheduling of multiple customized products with a common base product," IISE Transactions, Taylor & Francis Journals, vol. 51(12), pages 1383-1401, December.
    11. Hamilton Emmons, 1969. "One-Machine Sequencing to Minimize Certain Functions of Job Tardiness," Operations Research, INFORMS, vol. 17(4), pages 701-715, August.
    12. 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.
    13. Lu, Lingfa & Ng, C.T. & Zhang, Liqi, 2011. "Optimal algorithms for single-machine scheduling with rejection to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 130(2), pages 153-158, April.
    14. Zhi-Long Chen & Nicholas G. Hall, 2008. "Maximum Profit Scheduling," Manufacturing & Service Operations Management, INFORMS, vol. 10(1), pages 84-107, February.
    15. 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.
    16. 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.
    17. Zhang, Liqi & Lu, Lingfa & Yuan, Jinjiang, 2009. "Single machine scheduling with release dates and rejection," European Journal of Operational Research, Elsevier, vol. 198(3), pages 975-978, November.
    18. 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.
    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. 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.
    2. Li, Xin & Ventura, Jose A., 2020. "Exact algorithms for a joint order acceptance and scheduling problem," International Journal of Production Economics, Elsevier, vol. 223(C).
    3. 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.
    4. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    5. Zhong, Xueling & Ou, Jinwen & Wang, Guoqing, 2014. "Order acceptance and scheduling with machine availability constraints," European Journal of Operational Research, Elsevier, vol. 232(3), pages 435-441.
    6. Tarhan, İstenç & Oğuz, Ceyda, 2022. "A matheuristic for the generalized order acceptance and scheduling problem," European Journal of Operational Research, Elsevier, vol. 299(1), pages 87-103.
    7. 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.
    8. Xiao, Yiyong & Yuan, Yingying & Zhang, Ren-Qian & Konak, Abdullah, 2015. "Non-permutation flow shop scheduling with order acceptance and weighted tardiness," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 312-333.
    9. Peihai Liu & Xiwen Lu, 2020. "New approximation algorithms for machine scheduling with rejection on single and parallel machine," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 929-952, November.
    10. 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).
    11. Jinwen Ou & Xueling Zhong & Xiangtong Qi, 2016. "Scheduling parallel machines with inclusive processing set restrictions and job rejection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 667-681, December.
    12. 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.
    13. Ou, Jinwen & Zhong, Xueling & Wang, Guoqing, 2015. "An improved heuristic for parallel machine scheduling with rejection," European Journal of Operational Research, Elsevier, vol. 241(3), pages 653-661.
    14. Jinwen Ou & Xueling Zhong, 2017. "Order acceptance and scheduling with consideration of service level," Annals of Operations Research, Springer, vol. 248(1), pages 429-447, January.
    15. Esmaeilbeigi, Rasul & Charkhgard, Parisa & Charkhgard, Hadi, 2016. "Order acceptance and scheduling problems in two-machine flow shops: New mixed integer programming formulations," European Journal of Operational Research, Elsevier, vol. 251(2), pages 419-431.
    16. Simon Thevenin & Nicolas Zufferey & Rémy Glardon, 2017. "Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions," Annals of Operations Research, Springer, vol. 259(1), pages 437-460, December.
    17. de Weerdt, Mathijs & Baart, Robert & He, Lei, 2021. "Single-machine scheduling with release times, deadlines, setup times, and rejection," European Journal of Operational Research, Elsevier, vol. 291(2), pages 629-639.
    18. Cheng He & Joseph Y.-T. Leung & Kangbok Lee & Michael L. Pinedo, 2016. "Improved algorithms for single machine scheduling with release dates and rejections," 4OR, Springer, vol. 14(1), pages 41-55, March.
    19. Shabtay, Dvir & Steiner, George & Zhang, Rui, 2016. "Optimal coordination of resource allocation, due date assignment and scheduling decisions," Omega, Elsevier, vol. 65(C), pages 41-54.
    20. Wang, Xiuli & Cheng, T.C.E., 2015. "A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint," International Journal of Production Economics, Elsevier, vol. 161(C), pages 74-82.

    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:eee:proeco:v:220:y:2020:i:c:s0925527319302580. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.