IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v221y2024icp645-662.html
   My bibliography  Save this article

Newsvendor model for a dyadic supply chain with push-pull strategy under shareholding and risk aversion

Author

Listed:
  • Chen, Jianxin
  • Hou, Rui
  • Zhang, Tonghua
  • Zhou, Yongwu

Abstract

This paper investigates the optimization and coordination problem in the framework of classic push and pull newsvendor models under shareholding and CVaR criterion. A decentralized supply chain consisting of upstream supplier and the downstream manufacturer is considered. Firstly, taking the risk aversion into account, the optimal decision-makings are investigated under shareholding in push, pull supply chain respectively. By comparison it is found that the optimal order or production quantity depends on the degree of member’s risk aversion and shareholding ratio. Furthermore, the combined contracts are designed to coordinate the supply chain and optimal coordination parameters are obtained. Besides, the impacts of risk-averse preference and the shareholding fraction on supply chain performance are also investigated. The results indicate that in push supply chain the optimal ordering increases in the risk-averse parameter of the downstream manufacturer and the percentage of shares held by the upstream supplier in the downstream manufacturer. However, the optimal wholesale price makes the opposite change. In pull supply chain, the optimal production quantity is independent of the shareholding fraction and decreases with regards to the supplier’s risk aversion. Lastly, some numerical examples are given to illustrate the theoretical results and some suggestions to supply chain management are also provided.

Suggested Citation

  • Chen, Jianxin & Hou, Rui & Zhang, Tonghua & Zhou, Yongwu, 2024. "Newsvendor model for a dyadic supply chain with push-pull strategy under shareholding and risk aversion," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 221(C), pages 645-662.
    • Handle: RePEc:eee:matcom:v:221:y:2024:i:c:p:645-662
    DOI: 10.1016/j.matcom.2024.03.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475424000922
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2024.03.012?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.

    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:matcom:v:221:y:2024:i:c:p:645-662. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.