IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v32y2022i2p89-104id6.html
   My bibliography  Save this article

Determination of EOQ in terms of optimum degrees of horizontal and vertical cooperation at a node of supply chain

Author

Listed:
  • Prem Prakash Mishra
  • Chipem Zimik
  • Surajit Borkotokey

Abstract

In a complex supply chain network, the production nodes, seller nodes, and buyers are connected randomly. We assume a process of joining two random nodes leading to the bivariate Poisson probability mass function. There exist two types of links- one is horizontal (H) and the other is vertical (V), which support the continuous flow of commodities through the supply chain. This induces competition among workers at a node to manage these two types of links within fixed constraints and creates bargaining to decide the optimal degree of both types of links at a node. We use the Nash security point to obtain the bargaining solution describing the optimal links. We reduce the carrying cost and ordering cost of inventory, which are contrary in their nature by introducing horizontal and vertical links, respectively. We modify the total cost function and establish a new economic order quantity (EOQ), optimal shortage quantity, and total optimal cost in terms of the optimal degree of H and V cooperation.

Suggested Citation

  • Prem Prakash Mishra & Chipem Zimik & Surajit Borkotokey, 2022. "Determination of EOQ in terms of optimum degrees of horizontal and vertical cooperation at a node of supply chain," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 32(2), pages 89-104.
    • Handle: RePEc:wut:journl:v:32:y:2022:i:2:p:89-104:id:6
    DOI: 10.37190/ord220206
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/ord2022vol32no2_6.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.37190/ord220206?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
    ---><---

    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:wut:journl:v:32:y:2022:i:2:p:89-104:id:6. 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: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.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.