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

Prem Prakash Mishra (), Chipem Zimik () and Surajit Borkotokey ()

Operations Research and Decisions, 2022, vol. 32, issue 2, 89-104

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.

Keywords: cross-docking; location-allocation; transportation problem; mixed-integer nonlinear model; consolidation (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ord.pwr.edu.pl/assets/papers_archive/ord2022vol32no2_6.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wut:journl:v:32:y:2022:i:2:p:89-104:id:6

DOI: 10.37190/ord220206

Access Statistics for this article

More articles in Operations Research and Decisions from Wroclaw University of Science and Technology, Faculty of Management Contact information at EDIRC.
Bibliographic data for series maintained by Adam Kasperski ().