Next Article in Journal
Generalized (σ,ξ)-Contractions and Related Fixed Point Results in a P.M.S
Previous Article in Journal
Characterization of n-Vertex Graphs of Metric Dimension n − 3 by Metric Matrix
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Coordinating Supply-Chain Management under Stochastic Fuzzy Environment and Lead-Time Reduction

by
Asif Iqbal Malik
1 and
Biswajit Sarkar
2,*
1
Department of Industrial & Management Engineering, Incheon National University, 119, Academy-ro, Yeonsu-gu, Incheon 406772, Korea
2
Department of Industrial & Management Engineering, Hanyang University, Ansan 155 88, Gyeonggi-do, Korea
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(5), 480; https://doi.org/10.3390/math7050480
Submission received: 23 April 2019 / Revised: 20 May 2019 / Accepted: 21 May 2019 / Published: 27 May 2019
(This article belongs to the Section Engineering Mathematics)

Abstract

:
In this paper, a supply-chain (SC) coordination method based on the lead-time crashing is proposed for a seller–buyer system. By considering different transportation modes, we control the lead-time (LT) variability. For the first time, we have attempted to determine the impact of the reliable and unreliable seller in a continuous-review supply-chain model under the stochastic environment. The authors discussed two reliability cases for the seller. First, we consider the seller is unreliable and in the second case, the seller is reliable. In addition, the demand during the lead time is stochastic with the known mean and variance. The proposed approach tries to find an optimal solution that performs well without a specific probability distribution. Besides, a discrete investment is made to reduce the setup cost, which will indirectly help supply-chain members to increase the total profit of the system. In the proposed model, the seller motivates the buyer by reducing lead time to take part in coordinating decision-making for the system’s profit optimization. We derive the coordination conditions for both members, the seller and the buyer, under which they are convinced to take part in the cooperative decision-making plan. Therefore, lead-time crashing is the proposed incentive mechanism for collaborative supply-chain management. We use a fixed-charge step function to calculate the lead-time crashing cost for slow and fast shipping mode. We give two numerical examples to validate the proposed models and demonstrate the service-level enhancement under the collaborative supply-chain management in case of an unreliable seller. Concluding remarks and future extensions are discussed at the end.

1. Introduction

In recent years, the supply-chain coordination mechanism between supply-chain players has gained the enormous interest of researchers. Each player’s decisions in the supply chain not only affect his/her profit but also have a substantial impact on the other player’s profitability. However, it is common that in the decentralized decision-making system the seller’s optimal values are unacceptable for the buyer and buyer’s optimal solutions are undesirable to the seller. Usually, this problem happens due to more profit or benefits to the more powerful party. Both parties can resolve this problem by negotiating over the optimal policy [1], which is acceptable to both and it is dependent on the vendor–buyer relationships.
Researchers are developing different coordination techniques and mechanisms to convince supply-chain members for combined or coordinated decision-making to optimize the overall profit of the supply-chain system. Usually, different transportation modes are available for order shipment between supply-chain parties. For each transportation mode, transportation lead time and cost is different. Use of slow shipping mode is cheaper compared to the fast mode which requires significantly higher transportation cost. However, slower shipping mode requires a long transportation lead time which results in late deliveries for customers or buyers. On the buyer’s side, overstocking is caused by uncertainties in demand and uncertain transportation lead time. To avoid this risk of overstocking, the buyer can reduce its service level, but the problem gets worse because the service level directly affects the profitability of the buyer and the whole supply chain. On the other side, the seller can increase the service level to mitigate stockout, but the inventory cost increases with the increase in service level. Therefore, the buyer will not agree to amplify service level because of the profit loss.
Recently, Heydari et al. [2] considered transportation lead-time reduction at the seller’s end as an incentive mechanism to convince the buyer to undertake cooperative decision-making within the supply chain. They considered normally distributed stochastic demand and the fixed setup cost for the seller. However, in real-life problems, it is difficult to get complete information about the demand distribution precisely. The unknown distribution also creates another major issue for the buyer to find the near-optimal value of demand during the lead time. Therefore, researchers adopted a distribution-free approach to solve these types of problems, which is a more realistic approach [3,4,5]. It is proved from the literature that additional investments can reduce the setup cost for the production system [6,7,8,9]. Mostly, researchers consider continuous investments for controlling the setup cost; however, the discrete investment can be more realistic as the industry may not prefer continuous investment; thus, this is another research gap in the literature. The proposed study is the first in supply-chain coordination with multiple transportation modes and stochastic fuzzy demand.
The significant contributions of this study are: it uses a reduction in transportation lead time as coordination scheme between supply-chain members. We consider setup cost as a variable and use a discrete investment function to reduce the setup cost. To make this model a realistic one, we considered lead-time demand to be stochastic with unknown distribution function and limited known information, i.e., mean and standard deviation. Therefore, the authors used a distribution-free approach to solve this problem. In addition, we developed two scenarios based on the seller’s reliability for this model: (1) reliable seller; and (2) unreliable seller. To the best of the authors’ knowledge, this model is the first time we consider reliable and unreliable sellers, variable setup cost, uncertainties in demand, and shipping mode enhancement with the distribution-free approach for lead-time demand. We hope this model will open a new direction in lead-time (LT) reduction by transportation mode selection, stochastic fuzzy demand, and supply-chain coordination.

2. Literature Review

In the supply chain, researchers and practitioners develop different coordinating mechanisms for enhancing profitability. Researchers published research with different coordination techniques for the supply chain. Sana [1] developed an imperfect production model for collaborating the supply chain with the production rate, the number of shipments, and order quantity as decision variables. They introduced a three-member supply-chain coordination scheme centralized decision-making with the buy-back policy for defective items. Panda [10] introduced manufacturer-retailer supply chain with cost-sharing mutual contract as a coordinating scheme between manufacturer-retailer under time- and price-dependent demand rate. Panda et al. [11] studied a perishable product’s three-echelon SC model with bargaining over disposal cost-sharing between vendor and buyer. Roy et al. [12] introduced a cooperative advertising policy for a two-layer supply-chain pricing problem. They consider the demand as partly dependent on the promotional effort and uncertain factors with buy-back policy for unsold items by the retailer.
Furthermore, a two-echelon SC for different demand patterns with revenue sharing was studied by Panda et al. [13]. Giri and Sharma [14] studied wholesale pricing strategies in a Stackelberg game approach with advertising cost-sharing contract between players in a two-player supply chain. They developed two different models and irrespective of sales cost differences for retailers they set the same wholesale price. Saha et al. [15] developed a coordination supply-chain model by considering two different promotional policies: (i) downward direct discounts, and (ii) mail-in-rebate. Furthermore, Saha and Goyal [16] studied a multi-echelon supply-chain model with three different coordination mechanisms, i.e., wholesale price discount, contract for cost-sharing, and contract of a joint rebate. Recently, Heydari et al. [2] introduced a stochastic supply-chain model with lead-time crashing by different transportation modes as the cooperative scheme. An agro-industry-based supply-chain model was developed for revenue sharing within players by Sana et al. [17]. For further in-depth study, readers can see Basiri and Heydari [18], Pal, Sana, and Chaudhuri [19], Johari and Hosseini-Motlagh [20] and Venegas and Ventura [21].
In the supply chain, controlling lead time has gained the attention of several researchers and practitioners over the past decade. For the first time, Liao and Shyu [22] introduced lead-time crashing cost for controlling lead time within different inventory models. Arkan and Hejazi [23] studied a two-echelon coordinating supply chain by using the credit period as coordination contract with controllable lead time and reduction in ordering cost. Glock [24] developed a single-vendor single-buyer integrated model for different lead-time reduction strategies with stochastic demand and lead times as a function of lot-size. Furthermore, Jha and Shanker [25] extended it to single-vendor multi-buyer model. Soni et al. [26] studied an imperfect production-inventory model with fuzzy costs, controllable lead time, and investment for lost sales reduction and quality improvement.
Several authors used LT variation control as a coordination mechanism to convince the vendor and buyer to undertake collaborative decision-making. Chaharsooghi and Heydari [27] considered the importance of variation reduction in lead-time variance and lead-time mean to enhance the supply-chain profit. Ye and Xu [28] analyzed a cost allocation model with different bargaining powers for retailer and supplier. They considered one member as more powerful and paid a lower crashing cost compared to the weaker member. Li et al. [29] investigated a supplier-buyer model with service-level (SL) constraint for the supplier, lead-time crashing cost for the buyer, and suggested a price discount policy for coordination and information sharing. Heydari [30] studied a supply-chain model with controllable lead-time variations for coordination between vendor and buyer to maximize the whole system profit. Recently, Heydari et al. [2] suggested a lead-time reduction problem with stochastic lead-time demand. They introduced the fixed-charge transportation model with different shipment modes and coordination scheme over transportation cost. They considered that the limited lead-time reduction is possible with the same shipment mode and it can be reduced more by enhancing the mode from a slower to a faster one with an extra fixed cost.
In the literature, researchers consider lead-time demand as normally distributed, but in real-world problems it is nearly impossible to get complete information and an exact distribution function of lead-time demand. Therefore, Scarf [31] introduced a distribution-free approach for stochastic demand with limited information. Gallego and Moon [32] simplified the proof of the Scarf’s distribution-free approach where only the mean and standard deviation of the lead-time demand is known. Moon and Choi [33] studied a distribution-free approach with the controllable lead time for different continuous-review inventory models. Recently, Sarkar et al. [34] introduced an inventory model with controllable lead time, quality improvement, and discounted price for backordered quantity. They considered lead-time demand to be stochastic and used a min-max distribution-free approach to solve the problem with an unknown distribution. Udayakumar and Geeta [35] studied a supply-chain coordination model with variable lead-time and permissible delay in payments. They assumed lead time, the number of shipments, and order quantity as decision variables. They adopted normal distribution and distribution-free approaches to solve the stochastic lead-time demand problem. Furthermore, Malik and Sarkar [8] studied a continuous-review policy for multiple products with uncertain demand, investments for quality improvements and setup cost reduction, and lead-time control with unknown lead-time demand distribution. Malik and Sarkar [9] recently presented a backorder price discount model with controllable lead time and unknown distribution for lead-time demands. A recent study in a similar direction can be found in Dey et al. [4].
The setup cost is usually taken as a fixed or constant parameter in supply-chain models. However, it can be reduced with some initial investments to the system. For the first time, Porteus [36] introduced investment functions for quality improvement and setup cost reduction within inventory models. Sarker and Coates [37] analyzed the EOQ model for variable lead times and limited opportunities for investments in setup cost reduction. Huang et al. [38] suggested a cooperative vendor–buyer model for optimal inventory policy with variable setup cost by using the discontinuous investment function. Sarkar and Majumder [6] investigated a supply-chain model with the vendor’s setup cost reduction by using a continuous investment function and, based on the probability distribution of lead-time demand, they constructed two models. First, they consider lead-time demand as normally distributed and in the second model, limited information, i.e., mean and standard deviation, is known. Sarkar et al. [7] developed an imperfect vendor–buyer supply-chain model with continuous investments for setup cost reduction manufacturing quality improvement. Recently, Dey et al. [4] studied vendor–buyer supply-chain model with ordering cost and setup cost reduction model with discrete investments and flexible production rate.
In supply-chain management (SCM), unreliable (random yield) and reliable supply is a topic that has attracted researchers and managers in the last decade or two. Özekici and Parlar [39] studied a periodic review model with an unreliable suppliers problem in a random environment. Li et al. [29] investigated a production yield uncertainty problem in the supply chain with optimal order quantity and examined the profit loss of supply-chain members because of random yield. Recently, Park and Lee [40] introduced a single-period supply-chain model with multiple unreliable suppliers and distribution-free approach. They considered that the standard deviation is zero for a perfectly reliable supplier. Furthermore, Na et al. [41] considered the unreliable supplier problem with different customers, random demand, and multiple service levels. Giri and Chakarborty [42] analyzed a supply-chain model for stochastic demand and uncertain yield with the optimal shipment policy. The model considered two types of supplies, instantaneous and non-instantaneous, and revenue sharing as a coordination scheme. Pal, Sana, and Chaudhuri [19] investigated the supply-chain coordination model with random yield in the supplier’s manufacturing and analyzed the model under vertical Nash approach. They introduced revenue sharing and penalty as a coordination scheme between two players.
Furthermore, several studies on the relationship between artificial neural network, wavelet analysis, probability, fractal geometry, and stochastic fuzzy models can be found in the literature. On this topic, Hutchinson [43] studied the fractals and statistical self-similarity to model various physical phenomena. Melin and Castillo [44] studied the application of fractal theory and fuzzy logic for the industrial quality control with neural networks. Shah and Debnath [45] studied a hybrid method for yield based on coupling artificial neural network and discrete wavelet transforms. Guido et al. [46] studied a time-frequency analysis with wavelet transform for the biomedical signal processing. Guariglia [47] analyzed the entropy of fractal antennas and linked it to the physical performance and fractal geometrical shape. Guido [48] did some analyses to efficiently interpret the discrete wavelet-transformed signals. Roberto et al. [49] analyzed a multi-dimensional stochastic fuzzy system with training patterns for an artificial neural network and its applications to a neuro-fuzzy fabric evaluation system. Guariglia [50] investigated the generalization of the Sierpinski gasket through harmonic metric and its applications. In addition, the study on primality, image analysis, and fractality can be found in Guariglia [51]. They dealt with the hidden structure of prime numbers.

3. Problem Definition, Notation, and Assumptions

In this section, the problem is defined along with the basic assumptions and notations.

3.1. Problem Definition

From the existing literature, one can see that only a few pieces of research studies have considered lead time as a coordination mechanism between seller and buyer. This article contains different shipping modes for order shipments. Reliability of the seller is another essential factor to be considered while analyzing coordination between supply-chain members because the uncertainty in the seller’s supply creates stockouts which increase the chance of losing a good amount of profit. Furthermore, in stochastic cases mostly researchers have focused on lead-time demand following the normal distribution; a related article is Heydari et al. [2]. However, in real cases, it is challenging to make sure that the demand is following normal or any probability distribution. Previously, authors were considering setup cost as a fixed or constant parameter. There is a chance of saving a good amount of cost by investing once in setup to reduce the setup cost. By keeping these real-life factors in mind, this study is an attempt to make a coordination supply-chain model with stochastic fuzzy demand, which does not follow any distribution and investment with the discrete function reducing the setup cost for the system’s total profit maximization. This study discusses the centralized and decentralized decision-making models in detail. Moreover, we propose a coordination mechanism based on LT crashing with different shipping mode.

3.2. Notation

The following notations were used in this paper for mathematical model formulation.
Ddemand per year (units/year)
pretail price of the item ($/unit)
wwholesale price of the item ($/unit)
mraw material price of the item ($/unit)
S 0 initial setup cost per setup ($/setup)
A s ordering cost for seller per order ($/order)
A b ordering cost for buyer per order ($/order)
h s holding cost for seller per unit per year ($/unit/year)
h b holding cost for buyer per unit per year ($/unit/year)
B b shortages cost per unit ($/unit/unit time)
C S T transportation cost for slow mode
C F T transportation cost for fast mode
Fmaximum point at which more reduction in lead-time requires switching to fast shipping mode
Mmaximum possible crashing in lead-time
Tfixed cost for switching shipping mode
σ standard deviation for demand
Llead-time duration, it is controllable by seller
Qbuyer’s order quantity per order (units/order) (a decision variable)
nseller’s replenishment multiplier (a decision variable)
kinventory safety factor (a decision variable)

3.3. Assumptions

  • The coordination for integrated inventory model with single buyer and single seller is considered. The seller produces a single type of product. The buyer’s order quantity is produced in single stages. However, the seller delivers it in multiple shipments.
  • The buyer adopts a continuous-review inventory management policy. The buyer continuously keeps reviewing his inventory level and whenever the inventory level reaches the reorder point r the buyer immediately orders the quantity Q.
  • The reorder point is determined by r = D L + k σ L , where D L = is expected demand during the lead time, and is k σ L = safety stock.
  • Lead-time demand is stochastic, and distribution is unknown. Only the mean and standard deviation are known.
  • To reduce the setup cost, an additional discrete investment is needed. Thus, the model assumes a discrete investment function S ( J i ) = S 0 e r J i , where r is the known shape parameter, which is estimated using the previous data, and J is the setup cost for the seller. i = 0 , 1 , , n and J 0 = 0 .
  • Shortages lead to lost sales.
The information about the form of the probability distribution of the lead time is often limited in practice. In this model, the assumption about the distribution of the protection interval demand is relaxed, and it is only assumed that the density function of the lead-time demand belongs to the Ω with finite mean D L and standard deviation σ L . As the distributional form of lead-time demand X is unknown, the exact value of E ( X r ) + cannot be determined. Therefore, the min-max distribution-free approach is considered to solve this problem (Gallego and Moon [32]).
Min Max F Ω T E P subject to 0 < J S 0
The following proposition is used to approximate the value of E ( X r ) + which was proposed by Gallego and Moon [32].
Proposition 1.
For any F Ω ,
E ( X r ) + 1 2 { σ 2 L + ( r D L ) 2 ( r D L ) }
According to Gallego and Moon [32], the upper bound is tight
Replacing r with D L + k σ L into above equation, one can obtain
E ( X r ) + 1 2 σ L ( 1 + k 2 k )

4. Mathematical Model

In this section, three mathematical models are presented. First, a decentralized decision-making scenario is considered for seller and buyer. In the second model, a centralized system is analyzed for the combined decision-making for seller and buyer. In the end, a coordinating supply-chain model is developed, and lead-time reduction is used as a coordination scheme between seller and buyer for profit maximization.

4.1. Decentralized Decision-Making

In the decentralized supply-chain system, the buyer optimizes his decisions alone to maximize his profit. In reality, each supply-chain member tries to optimize his profit in the decentralized system without taking care of other members. In this study, the two decision variables, as service level (SL) and order quantity, are under the control of the buyer. The service level is determined by the inventory safety factor (k) and it has a notable impact on sales volume and profitability of buyer. In this model, the buyer acts as the supply-chain leader and the seller reacts as a follower to the buyer’s decisions.
This model uses the inventory model established by Silver et al. [52]. The buyer continuously keeps reviewing his inventory level and whenever the inventory in hand reaches the reorder point, the buyer immediately orders the quantity Q. In this paper, we examine a continuous-review model with shortages and distribution-free approach for lead-time demand. Therefore, the expected total profit for the buyer with a distribution-free approach and is defined as
E P b ( Q , k ) = ( p w ) D A b D Q h b Q 2 + k σ L + 1 2 σ L ( ( 1 + k 2 ) k ) ( B b + p w ) 1 2 σ L ( ( 1 + k 2 ) k ) D Q
In the above equation, the first term is the revenue for the buyer and the second term is holding cost for the buyer. The third term represents shortages in cost caused by the expected shortages during the cycle.
Setup cost
The seller has a fixed setup cost of S 0 per cycle, initially. The seller must fulfill the demand D per cycle, and he ships n Q quantity in each shipment. The numbers of cycles per year are D n Q . Therefore, one can express the seller’s setup cost per manufacturing setup as:
S T C = S ( J i ) D n Q ; where , S ( J i ) = S 0 e r J i , S T C = S 0 e r J i D n Q .
where r = known parameter and it is estimated by using the historical data, and J = investment required to achieve setup cost S per production cycle.
Investment for setup cost reduction
For the setup cost reduction, this model assumes an additional discrete investment J (Huang et al., 2011)
Investment for setup cos t reduction = J D Q
Hence, the expected total profit for seller is defined
E P s ( J , n ) = ( w m ) D 1 1 2 σ L ( ( 1 + k 2 ) k ) Q A s D ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n Q S 0 e r J i D ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n Q J D ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) Q h s ( n 1 ) Q 2 .
Fuzzification
In reality, it is difficult to predict the exact demand of a product. Mostly, the researchers considered constant demand by considering a distribution-free approach for lead-time demand. However, several researchers consider fuzzy demand (see for reference Sarkar and Mahapatra [53], Kumar and Goswami [54], Soni et al. [55], and Tayyab et al. [56]) with the distribution-free approach. Demand in existing literature is considered to be a triangular fuzzy number, so for this we are assuming it is a triangular number [57,58,59]. The main advantage of triangular member function is simplicity. A triangular membership function is used unless there is a good reason to do otherwise [59]. Furthermore, Taleizadeh et al. [60] presented a market investigation on the products and showed that product demand does not follow a specific pattern such that it can neither be considered fixed nor to have a certain probability distribution, justifying the usage of fuzzy triangular demand. Thus, the presented model also considers fuzzy triangular demand to make it realistic.
In the model, considered fuzzy demand D ˜ = ( D δ 1 , D , D + δ 2 ) is a non-negative triangular fuzzy number. One can obtain the expected profit function for buyer and seller by substituting the non-negative triangular fuzzy number in the above equation. Hence, the expected total profit for a buyer with a fuzzy demand
E P b ˜ ( Q , k ) = ( p w ) D ˜ A b D ˜ Q h b Q 2 + k σ L + 1 2 σ L ( ( 1 + k 2 ) k ) ( B b + p w ) 1 2 σ L ( ( 1 + k 2 ) k ) D ˜ Q ,
In addition, the expected total profit for seller with fuzzy demand
E P s ˜ ( J , n ) = ( w m ) D ˜ 1 1 2 σ L ( ( 1 + k 2 ) k ) Q A s D ˜ ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n Q S 0 e r J i D ˜ ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n Q J D ˜ ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) Q h s ( n 1 ) Q 2 .
Defuzzification
To get ultimate conclusions and decision-making, the fuzzy numbers are mostly converted to crisp values. The method used here for converting fuzzy results to the crisp models is commonly known among researchers as signed distance method. Hence, the expected profit for seller and buyer in a decentralized inventory model is given by:
E P b ( Q , k ) = ( p w ) D + 1 4 ( δ 2 δ 1 ) A b D + 1 4 ( δ 2 δ 1 ) Q h b Q 2 + k σ L + 1 2 σ L ( ( 1 + k 2 ) k ) ( B b + p w ) 1 2 σ L ( ( 1 + k 2 ) k ) D + 1 4 ( δ 2 δ 1 ) Q ,
E P s ( J , n ) = ( w m ) D + 1 4 ( δ 2 δ 1 ) 1 1 2 σ L ( ( 1 + k 2 ) k ) Q A s D + 1 4 ( δ 2 δ 1 ) ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n Q S 0 e r J i D + 1 4 ( δ 2 δ 1 ) ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n Q J D + 1 4 ( δ 2 δ 1 ) ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) Q h s ( n 1 ) Q 2 .
In the decentralized supply chain, the seller and buyer do not cooperate in decision-making and they only decide their optimal policies for individual profit maximization. First, the buyer decides his optimal order quantity Q and inventory safety factor k to maximize own expected annual profit. Then, the seller considers the buyer’s optimal values as an input to decide the optimal number of shipments n and possible investment for setup cost reduction and maximize his expected annual profit. In the decentralized case, the buyer is a leader and the seller is a follower in the decision-making sequence.
E P b ( Q , k ) Q = A b D + 1 4 ( δ 2 δ 1 ) Q 2 h b 1 2 + ( B b + p w ) 1 2 σ L ( ( 1 + k 2 ) k ) D + 1 4 ( δ 2 δ 1 ) Q 2 ,
E P b ( Q , k ) k = h b σ L + 1 2 σ L k ( 1 + k 2 ) 1 ( B b + p w ) 1 2 σ L k ( 1 + k 2 ) 1 D + 1 4 ( δ 2 δ 1 ) Q .
By using the necessary conditions for the multiple variables problem, one can easily obtain the optimal order quantity Q * for the decentralized system as
Q * = D + 1 4 ( δ 2 δ 1 ) 2 A b + ( B b + p w ) σ L ( ( 1 + k 2 ) k ) h b ,
and
k * 1 + k * 2 = 1 2 h b Q Q h b + ( B b + p w ) D + 1 4 ( δ 2 δ 1 ) .
To prove the concavity of the buyer’s expected profit regarding k and Q, the Hessian matrix is calculated. A negative definite Hessian matrix proves the concavity of the buyer’s profit for decision variables safety factor k and order quantity Q. The proof of the Hessian matrix is provided in Appendix A. To get the optimal values of the decision variables and profit for the buyer, the below Algorithm 1 is given.
Algorithm 1 Solution algorithm to find optimal results for decentralized SCM.
Step I:     Assign value for n = 1 , and set E T P ( Q , J , n , k ) = 0 ;
Step II:    Set value of s ( k ) = 0 ;
Step III:  Evaluate the value of Q from Equation (13);
Step IV:  Evaluate value of k and s ( k ) by using Equation (14);
Step V:   Repeat Step 2 to 4 with the obtained value of s ( k ) until the variation is negligible.
Similarly, one can obtain the optimal number of shipments for seller as
E P s ( J , n ) n = A s D + 1 4 ( δ 2 δ 1 ) ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n 2 Q + S 0 e r J i D + 1 4 ( δ 2 δ 1 ) ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n 2 Q h s Q 2 .
The seller decides his optimal number of shipments n * by predicting the buyer’s optimal order quantity Q * . Expected profit for the seller is convex for n when all the other parameters are fixed, hence
2 E P s ( J , n ) n 2 = 2 A s n 3 Q D + 1 4 ( δ 2 δ 1 ) 1 σ L ( ( 1 + k 2 ) k ) 2 Q .
Here, σ L ( ( 1 + k 2 ) k ) 2 Q is always less than 1. Hence, the second derivative of the expected profit for the seller with respect to n is negative. Therefore, expected profit function for the seller is concave for n.
The seller’s optimal value of n = n * is obtained, only when
E P s ( n * ) E P s ( n * + 1 ) E P s ( n * ) E P s ( n * 1 ) .

4.2. Centralized Decision-Making

In the centralized system, there is one supply-chain planner who makes all the globally optimal decisions by ensuring that the whole system’s profitability is maximized. In centralized decision-making in this model, the supply-chain planner considers only the original “slow” shipping mode and makes the decisions over variables Q, n, and k. The planner does not consider the lead-time crashing while optimizing these decision variables. The integrated seller–buyer inventory model under the centralized model and the expected total profit function of the supply chain is given by
E T P ( Q , k , J , n ) = E P b ( Q , k ) + E P s ( J , n ) = ( p w ) D A b D Q h b Q 2 + k σ L + 1 2 σ L ( ( 1 + k 2 ) k ) ( B b + p w ) 1 2 σ L ( ( 1 + k 2 ) k ) D Q + ( w m ) D 1 1 2 σ L ( ( 1 + k 2 ) k ) Q A s D ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n Q S 0 e r J i D ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n Q J D ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) Q h s ( n 1 ) Q 2 .
After some mathematical calculations, one can obtain the simplified profit function as
E T P ( Q , k , J , n ) = ( p m ) D A b + A s n D Q ( ( n 1 ) h s + h b ) Q 2 h b k σ L + 1 2 σ L ( ( 1 + k 2 ) k ) ( B b + p m A s n Q ) 1 2 σ L ( ( 1 + k 2 ) k ) D Q S 0 e r J i D ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n Q J D ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) Q .
Fuzzification
Fuzzifiaction is done similarly to in the previous decentralized model and the expected profit function is
E T P ˜ ( Q , k , J , n ) = ( p m ) D ˜ A b + A s n D ˜ Q ( ( n 1 ) h s + h b ) Q 2 h b k σ L + 1 2 σ L ( ( 1 + k 2 ) k ) ( B b + p m A s n Q ) 1 2 σ L ( ( 1 + k 2 ) k ) D ˜ Q S 0 e r J i D ˜ ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n Q J D ˜ ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) Q .
Defuzzification
The defuzzification is done similarly to in the previous decentralized model and the expected profit function is written as
E T P ( Q , k , J , n ) = ( p m ) D + 1 4 ( δ 2 δ 1 ) A b + A s n D + 1 4 ( δ 2 δ 1 ) Q ( ( n 1 ) h s + h b ) Q 2 h b k σ L + 1 2 σ L ( ( 1 + k 2 ) k ) ( B b + p m A s n Q ) 1 2 σ L ( ( 1 + k 2 ) k ) D + 1 4 ( δ 2 δ 1 ) Q S 0 e r J i D + 1 4 ( δ 2 δ 1 ) ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) n Q J D + 1 4 ( δ 2 δ 1 ) ( 1 1 2 σ L ( ( 1 + k 2 ) k ) Q ) Q .
From the necessary condition of the global optimality, we can write
E T P ( Q , k , J , n ) Q = A b + A s n D + 1 4 ( δ 2 δ 1 ) Q 2 ( n 1 ) h s + h b 1 2 + B b + p m 2 A s n Q 1 2 σ L ( ( 1 + k 2 ) k ) D + 1 4 ( δ 2 δ 1 ) Q 2 + S 0 e r J i D + 1 4 ( δ 2 δ 1 ) n Q 2 1 σ L ( ( 1 + k 2 ) k ) Q + J D + 1 4 ( δ 2 δ 1 ) Q 2 1 σ L ( ( 1 + k 2 ) k ) Q = 0 ,
Q * = D + 1 4 ( δ 2 δ 1 ) A b + A s n + Φ 1 2 ( B b + p m 2 A s n Q ) + S 0 e r J i n + J ( 1 Φ 1 Q ) 1 2 ( ( n 1 ) h s + h b )
Φ 1 = σ L ( ( 1 + k 2 ) k )
E T P ( Q , k , J , n ) k = h b σ L + 1 2 σ L k ( 1 + k 2 ) 1 ( B b + p m A s n Q ) 1 2 σ L k ( 1 + k 2 ) 1 D + 1 4 ( δ 2 δ 1 ) Q + S 0 e r J i D + 1 4 ( δ 2 δ 1 ) n Q 2 1 2 σ L k ( 1 + k 2 ) 1 + J D + 1 4 ( δ 2 δ 1 ) Q 2 1 2 σ L k ( 1 + k 2 ) 1
k ( 1 + k 2 ) = 1 2 h b Q 2 Q 2 h b ( B b + p m A s n Q ) Q S 0 e r J i n J D + 1 4 ( δ 2 δ 1 )
The expected profit for seller and the optimal values of the decision variables have been obtained by using Algorithm 2.
Algorithm 2 Solution algorithm to find optimal results for centralized SCM.
Step I:    Assign value for n = 1 and set E T P ( Q , J , n , k ) = 0 ;
Step II:    Set value of s ( k ) = 0 ;
Step III:    Evaluate the value of Q from Equation (22);
Step IV:    Evaluate value of k from Equation (25);
Step V:    Repeat calculations for (22) and (25) until the difference between two values is negligible;
Step VI:    The calculated values for decision variables are optimal for the fixed n;
Step VII:    Set n = n + 1 ; run from Step II to Step VI;
Step VIII:    The values that gives the maximum profit E T P ( Q , J , k , n ) are the optimal values for decision variables.

4.3. Coordination Mechanism between Seller and Buyer: Lead-Time Reduction

The expected profit function for buyer, as he commits to Q * * , J * * , k * * and exploiting from the reduced lead time ( L T ) , is:
E P b ( Q * * , k * * , L n e w ) = ( p w ) D + 1 4 ( δ 2 δ 1 ) A b D + 1 4 ( δ 2 δ 1 ) Q * * h b [ Q * * 2 + k * * σ L n e w + 1 2 σ L n e w ( ( 1 + k 2 * * ) k * * ) ] ( B b + p w ) 1 2 σ L n e w ( ( 1 + k 2 * * ) k * * ) D + 1 4 ( δ 2 δ 1 ) Q * *
here, L n e w is the reduced lead time and it is obtained by applying the reduction coefficient ( 1 R L T ) to the original lead time L i.e.,: L n e w = ( 1 R L T ) L
E P s ( J * * , n * * , L n e w ) = ( w m ) D + 1 4 ( δ 2 δ 1 ) 1 1 2 σ L n e w ( ( 1 + k 2 * * ) k * * ) Q * * A s D + 1 4 ( δ 2 δ 1 ) ( 1 1 2 σ L n e w ( ( 1 + k 2 * * ) k * * ) Q * * ) n * * Q * * S 0 e r J i * * D + 1 4 ( δ 2 δ 1 ) n * * Q * * J * * D + 1 4 ( δ 2 δ 1 ) Q * * h s ( n * * 1 ) Q * * 2 ( C R L T ) D Q * *
The cost for reduction in lead time is added at the end in the above equation; “CRLT” is the cost for reduction in lead time per replenishment cycle.
Kowalski and Lev [61] proposed an SFCTP (step-fixed-charge-transportation problem) and planned the transportation cost as a function of shipped units. Similarly, this study considers the CRLT as a function of the lead-time volume reduced. In the same way, this study proposes a function for CRLT which is based on SFCTP, see Figure 1 for graphical representation. The idea has a basis in the fact that in one shipping mode (e.g., train) the lead time can be reduced up to a limit and reduction beyond this limit is only by replacing this mode with the faster one (e.g., truck). The lead time considered here is not a function of order quantity because this model only considers the shipping lead time and ignores production or loading and unloading lead times. Therefore, it is assumed that the lead-time reduction cost is the function of the lead-time reduction and shipping mode. In a major transaction, lead-time reduction is in two ways:
  • Limited reduction is possible within the same shipping mode and CRLT increases linearly. The described type of reduction within the same shipping mode is limited to a level.
  • Extra reduction is achievable by switching the shipping model from slow to fast, and it adds an extra fixed cost to the seller.
The maximum lead-time (MLT) crashing can be defined as
M L T = Normal Lead - time Fully Crashed Lead - time Normal Lead - time
The value of M L T should always be less than 1 and the interval for lead-time reduction ( L T R ) is clear to be between 0 and M L T ( 0 , M L T ) . The lead-time reduction cost ( C R L T ) is given by
C R L T = C S T . L T R 0 < L T R F C F T ( L T R F ) + T + C S T . F F < L T R M L T
We consider two different shipping modes for this model, slow shipping mode and fast shipping mode. As described in assumptions, without shifting shipping mode only F (%) reduction in lead time is possible. Selection of shipping mode depends on the lead-time reduction coefficient; if it lies within interval [ 0 , F ] then slow shipping mode is suitable for the system. For the lead-time reduction coefficient beyond F and less than MLT (interval [ F , M L T ] ), then the fast shipping mode is appropriate for the seller.

4.3.1. Buyer’s Conditions for Participation in Joint Decision-Making

To make sure the buyer’s participation in decision-making with coordination is possible when his profit is more than the decentralized system, the participation constraint for the buyer is
E P b ( Q * * , k * * , L n e w ) E P b ( Q * , k * )
R L T m i n = 1 1 L Z Y 2
here,
Z = A b D 1 Q * * 1 Q * + h b 2 ( Q * * Q * ) h b k * σ L + 1 2 σ L ( ( 1 + k * 2 ) k * ) σ L ( ( 1 + k * 2 ) k * ) D 2 Q * ( B b + p w )
Y = h b k * * σ + 1 2 σ ( ( 1 + k * * 2 ) k * * ) σ ( ( 1 + k * * 2 ) k * * ) D 2 Q * * ( B b + p w )

4.3.2. Seller’s Conditions for Participation in Joint Decision-Making

E P s ( Q * * , k * * , n * * , L n e w ) E P s ( Q * , k * , n * )
Because of the complexity of the coordination model for the seller, it is not possible to find the closed-form formula for the maximum value of lead-time reduction ( R L T m a x ) . Therefore, the Algorithm 3 is given below to calculate the maximum value for the seller ( R L T m a x ) which is to make sure the participation in coordination.
Algorithm 3 Solution algorithm to find optimal ‘RLT’.
Step I:    Assign value for L R = M ;
Step II:    Evaluate Equation (17) for the coordination model and calculate seller’s profit;
Step III:    Check Equation (34) the participation constraint for seller;
Step IV:    In case the participation condition for the seller in Equation (34) is not satisfied, then set the value R L T = R L T a , where a is a very small positive quantity, and repeat Step V; otherwise, the obtained value for R L T is R L T m a x .
Lastly, after obtaining R L T m a x and R L T m i n , all values of R L T in the interval [ R L T m i n , R L T m a x ] are acceptable for the channel coordination. However, based on the relative bargaining power of supply-chain members, an appropriate value of R L T is chosen from interval [ R L T m i n , R L T m a x ] . To obtain the acceptable value of R L T within interval [ R L T m i n , L R m a x ], one can apply a linear model with bargaining powers of supply-chain members. Based on a linear model, one can write L R = η L R m i n + ( 1 η ) L R m a x , where η is a positive real number in an interval [ 0 , 1 ] , and it represents the bargaining power for the seller in comparison to the buyer. The larger value of η (near to 1) makes R L T closer to the lower bound ( R L T m i n ), which creates more savings for the seller. Meanwhile, the lower value of α (near to zero) makes R L T near to the upper bound ( L R m a x ). It means more profit for the buyer. Here, the below Theorem 1 outlines the major insight from the proposed supply-chain coordination policy.
Theorem 1.
All values of R L T in given interval [ R L T m i n , R L T m a x ] can synchronize the inventory and pricing decisions between supply-chain members. If R L T * = R L T m i n then the seller will enjoy all the benefits of the coordinated decisions, which means more savings for the seller. If R L T * = R L T m a x then the buyer will enjoy all the benefits of coordinated decisions.
Proof. 
From a linear model with relative bargaining powers one can write
L R = η L R m i n + ( 1 η ) L R m a x ,
where η is a real positive number in an interval [ 0 , 1 ] . One can obtain,
L R = L R m i n , when η is 1 ,
and, one gets
L R = L R m a x , when η is 0.
 □

5. Numerical Example

To validate the proposed model, we conducted a set of numerical examples. The input data is taken from Heydari et al. [2] and it is given in Table 1. Results for numerical examples are given in Table 2, Table 3, Table 4 and Table 5.
As one can see from Table 2, there is a significant increase in profit for the whole SCM under centralized decision-making as compared to decentralized decision-making, which means the join decision-making on decision variables creates more advantages in terms of profit if the SCM is designed properly.
The SCM managers can enhance the service level with the proposed coordination scheme, and it is shown in Table 3. One can see the increase in profit for the coordinating system for Example 2 when the seller is unreliable. This profitability enhancement is mainly because of the service-level improvement under coordinated decision-making.
We see from Table 4 and Table 5 that the increase in profit under centralized decision-making is more in the case of a reliable seller than an unreliable seller. This performance improvement shows the importance of the reliability of SCM members for the profitability of the entire system.
The centralized decision policy is making more profit than the decentralized decision-making for the whole supply-chain management in Problem 1 for both the reliable seller and unreliable seller case. However, the service level to the customers is under the decentralized strategy in both cases for Problem 1. Meanwhile, for Problem 2, the profit is more under the coordinating strategy when the seller is unreliable and for the reliable seller case profit is slightly higher under the centralized strategy. This comparison shows that the centralized SCM for decision-making regarding order quantities and other decision variables makes more profit for SCM players in all cases. Besides this, it reduces the expected shortages for the buyer. Hence, it increases the service level for the supply chain and is effective for enhancing profitability.

6. Sensitivity Analysis

This section presents sensitivity analyses for major parameters to show the overall effect of value changes on the total profit in both cases, i.e., reliable and unreliable seller. This sensitivity analysis is performed by changing the parameter values to 50 % , 25 % + 25 % and + 50 % and keeping other parameters unchanged. Table 6 and Table 7 present the results of the sensitivity analysis of Problem 1.
From sensitivity analysis, provided in Table 6 and Table 7, we observe that the ordering cost for the buyer is very sensitive to the profit under the decentralized and centralized SCM. The second most sensitive parameter is the setup cost for the seller in both cases. This trend is very similar for unreliable and reliable seller cases. The SCM planner should consider the ordering cost for the buyer to be a critical factor while making the decisions.

Managerial Insights

The aim of the supply chain initially started with achieving more profit together, i.e., a centralized system. However, with time researchers have developed different coordination schemes to convince the seller and buyer to undertake cooperative decision-making to make the supply chain more profitable as a whole. In this study, the proposed model is also supported for the same strategy. Even though different shipping modes are adopted, the centralized supply chain always has given more profit than the decentralized one. For decades, the distribution-free approach had been adopted in the industry to calculate the expected amount of shortages during lead times. Still, the industry has trouble due to uncertainty in demand and longer lead times. Another aspect that makes the case worse is the unreliability of the seller. If there is an increase, how the industry managers or practitioners will tackle these situations can be solved or modeled by the suggested solution methodology in the proposed model. The lead time should be decreased to control the expected amount of shortages, even if extra cost is required, i.e., the faster shipping mode comes into practice with some additional cost to obtain more profit. The significant impact of shorter lead time is on service level and increase in service level usually increases the profitability of the supply chain. Generally, the seller is considered sufficiently reliable, but this is not the same in practical situations. Thus, considering the reliability of the seller will help managers to plan accordingly to obtain more profit. Therefore, the industry managers and practitioners can adopt these policies together to obtain the global maximum profit for their system.

7. Conclusions

Herein, we established transportation lead-time shortening as a coordination mechanism between the seller and buyer by considering a reliable seller and unreliable seller. The variable setup cost, order quantity, and service level were the significant factors to optimize the profitability of the whole supply chain. For the first time, we considered reliable and unreliable sellers for the coordination supply-chain model. To include a real-life-based scenario to the model, we considered lead-time demand as stochastic with an unknown distribution and used a distribution-free approach to solve it. The application of the proposed model led to notable setup cost reduction, service-level improvement, and an increase in profitability of the whole system. In the presented model, the demand is stochastic fuzzy and lead time was controllable by the seller. The lead-time demand distribution is unknown with limited information, i.e., only with known mean and variance. Investing more to the initial setup cost, the seller can reduce his setup cost per setup, and this improves profit significantly for the seller and the whole system. At the seller’s end, transportation lead time is reduced by spending more on the shipping mode and hence the seller can convince the buyer to take part in coordination and optimize decisions centrally. From the model, the smaller lead time and information about the seller’s reliability are beneficial for the buyer because of lower inventory costs and improved service level. Thus, the lead-time reduction is performed as a coordination scheme to convince the buyer and seller to take part in coordinated decision-making. In this study, we discussed three different scenarios: (1) centralized decision-making; (2) decentralized decision-making with the buyer as leader and sellers as the follower; and (3) a coordinating decision-making. The solution suggests that the shift from decentralized to the centralized system must guarantee the increased profitability for each supply-chain member. In the proposed study, each of the three cases (decentralized, centralized, and coordinated) were studied separately for unreliable and reliable sellers. We consider the variance of demand as σ = 0 when the seller is reliable, and there is the value for σ when the seller is not reliable or is unreliable. In each case, the profitability for SC is more when the seller is reliable and vice versa.
To make the mathematical model realistic, we include the reliability of the seller in the model. With the proposed incentive scheme, we consider the CRLT function for the seller to reduce the lead time with two different transportation modes, slow and fast. Slow shipping mode takes a longer time to deliver the order, but it is cheaper. However, fast shipping mode has a shorter delivery time with additional cost. Lead-time reduction within the same shipping mode is possible only to a certain limit. The seller can use a faster shipping mode where the lead-time reduction is required beyond the specified limit. The application of this coordination model leads to a higher supply-chain profitability as compared to the non-cooperative or decentralized decision-making.
There are several limitations to the proposed model. The model is applied to single-seller single-buyer-based supply-chain management with single-stage manufacturing. Also, this model does not consider the environmental impact of shipping modes in terms of carbon emissions. Another limitation of this model is the linear cost function for different shipping modes. Therefore, this model is extendable to a few new directions by considering multiple reliable and unreliable sellers and a single buyer [62]. This paper can also be extended by considering non-linear and complicated function instead of a linear step fixed-charge function. Another extension is to consider the carbon emission cost for both slow and fast shipping modes and observe the economic and environmental effect of it [63]. Another possible extension would be product-channeling in SCM with an online to offline (O2O) strategy [64].

Author Contributions

The authors contributed equally to the research.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

For the Hessian matrix calculations we have to calculate second order derivatives with respect to the decision variables k and Q.
2 E P b ( Q , k ) Q 2 = 2 A b D + 1 4 ( δ 2 δ 1 ) Q 3 2 ( B b + p w ) 1 2 σ L ( ( 1 + k 2 ) k ) D + 1 4 ( δ 2 δ 1 ) Q 3
E P b ( Q , k ) k 2 = 1 2 σ L 1 ( 1 + k 2 ) k 2 ( 1 + k 2 ) 3 2 h b + ( B b + p w ) D + 1 4 ( δ 2 δ 1 ) Q = σ L 2 1 + k 2 3 h b + ( B b + p w ) D + 1 4 ( δ 2 δ 1 ) Q
E P b ( Q , k ) k Q = E P b ( Q , k ) Q k = ( B b + p w ) σ L 2 Q 2 k ( 1 + k 2 ) 1 D + 1 4 ( δ 2 δ 1 )
H i i = | 2 E P b ( Q , k ) Q 2 E P b ( Q , k ) Q k E P b ( Q , k ) k Q 2 E P b ( Q , k ) k 2 |
det H 11 = 2 E P b ( Q , k ) Q 2 < 0
As we know, B b + p > w therefore, the 1st principal minor of H is negative det H 11 < 0 . We can calculate the 2nd principal minor as
det H 22 = 2 E P b ( Q , k ) Q 2 × 2 E P b ( Q , k ) k 2 E P b ( Q , k ) Q k × E P b ( Q , k ) k Q = D + 1 4 ( δ 2 δ 1 ) Q 3 2 A b 2 ( B b + p w ) 1 2 σ L ( ( 1 + k 2 ) k ) × σ L 2 1 + k 2 3 h b + ( B b + p w ) D + 1 4 ( δ 2 δ 1 ) Q ( B b + p w ) σ L 2 Q 2 k ( 1 + k 2 ) 1 D + 1 4 ( δ 2 δ 1 ) 2
det H 22 = σ L D + 1 4 ( δ 2 δ 1 ) Q 3 1 + k 2 3 A b + ( B b + p w ) 1 2 σ L ( ( 1 + k 2 ) k ) × h b + ( B b + p w ) D + 1 4 ( δ 2 δ 1 ) Q ( B b + p w ) σ L 2 Q 2 k ( 1 + k 2 ) 1 D + 1 4 ( δ 2 δ 1 ) 2
det H 22 = σ L D + 1 4 ( δ 2 δ 1 ) Q 3 1 + k 2 3 [ A b h b + h b ( B b + p w ) 1 2 σ L ( ( 1 + k 2 ) k ) + A b ( B b + p w ) D + 1 4 ( δ 2 δ 1 ) Q + σ L ( B b + p w ) 2 ( ( 1 + k 2 ) k ) D + 1 4 ( δ 2 δ 1 ) 2 Q ] ( B b + p w ) 2 σ 2 L 4 Q 4 k ( 1 + k 2 ) 1 2 D + 1 4 ( δ 2 δ 1 ) 2
det H 22 = D + 1 4 ( δ 2 δ 1 ) Q 3 1 + k 2 3 [ A b h b + h b ( B b + p w ) 1 2 σ L ( ( 1 + k 2 ) k ) + A b ( B b + p w ) D + 1 4 ( δ 2 δ 1 ) Q + σ L ( B b + p w ) 2 ( ( 1 + k 2 ) k ) D + 1 4 ( δ 2 δ 1 ) 2 Q ] ( B b + p w ) 2 σ L 4 Q 4 k ( 1 + k 2 ) 1 2 D + 1 4 ( δ 2 δ 1 ) 2
det H 22 = D + 1 4 ( δ 2 δ 1 ) Q 3 1 + k 2 3 [ A b h b + h b ( B b + p w ) 1 2 σ L ( ( 1 + k 2 ) k ) + A b ( B b + p w ) D + 1 4 ( δ 2 δ 1 ) Q + σ L ( B b + p w ) 2 ( ( 1 + k 2 ) k ) D + 1 4 ( δ 2 δ 1 ) 2 Q ] ( B b + p w ) 2 σ L 4 Q 4 k ( 1 + k 2 ) 1 2 D + 1 4 ( δ 2 δ 1 ) 2
The 2nd principal minor of H is det . H 22 > 0 , if we have
4 Q D + 1 4 ( δ 2 δ 1 ) A b h b + h b ( B b + p w ) 1 2 σ L ( ( 1 + k 2 ) k ) + 2 σ L ( B b + p w ) 2 ( ( 1 + k 2 ) k ) + A b ( B b + p w ) ( B b + p w ) 2 σ L 1 + k 2 3 k ( 1 + k 2 ) 1 2 0

Appendix B

Hessian matrix at the optimal points is considered as
H i i = | 2 E T P ( Q , k , J , n ) Q * * 2 2 E T P ( Q , k , J , n ) Q * * k * * 2 T C s y s ( Q , P , J , k ) k * * Q * * 2 T C s y s ( Q , P , J , k ) k * * 2 |
To calculate the Hessian matrix one needs to calculated the second order partial derivatives with respect to the considered decision variables.
2 E T P ( Q , k , J , n ) Q 2 = 2 D + 1 4 ( δ 2 δ 1 ) Q 3 [ ( B b + p m 3 A s n Q ) Φ 2 + A b + A s n + S 0 e r J i n + J ( 1 3 Φ 2 2 Q ) ]
Φ 2 = 1 2 σ L ( ( 1 + k 2 ) k )
2 E T P ( Q , k , J , n ) Q k = 2 E T P ( Q , k , J , n ) k Q = ( B b + p m 2 A s n Q ) 1 2 σ L k ( 1 + k 2 ) 1 D + 1 4 ( δ 2 δ 1 ) Q 2 S 0 e r J i D + 1 4 ( δ 2 δ 1 ) n Q 3 1 2 σ L k ( 1 + k 2 ) 1 J D + 1 4 ( δ 2 δ 1 ) Q 3 1 2 σ L k ( 1 + k 2 ) 1 = 1 2 σ L k ( 1 + k 2 ) 1 D + 1 4 ( δ 2 δ 1 ) Q 3 [ Q ( B b + p m 2 A s n Q ) 2 S 0 e r J i n 2 J ]
E T P ( Q , k , J , n ) k 2 = 1 2 σ L 1 1 + k 2 3 [ h b + ( ( B b + p m A s n Q ) 1 Q + S 0 e r J i n Q 2 + J Q 2 ) D + 1 4 ( δ 2 δ 1 ) ]
Now, to calculate the Hessian matrix we calculate
det H 11 = det 2 E T P ( Q , k , J , n ) Q * * 2 = 2 D + 1 4 ( δ 2 δ 1 ) Q 3 [ ( B b + p m 3 A s n Q ) Φ 2 + A b + A s n + S 0 e r J i n + J ( 1 3 Φ 2 2 Q ) ]
For a profitable supply chain, always we have 3 Φ 2 2 Q less than 1 and B b + p m 3 A s n Q 0 , therefore, the first principle minor of Hessian matrix is negative definite ( det H 11 < 0 ). The second principal minor is calculated as:
det H 22 = det 2 E T P ( Q , k , J , n ) Q * * 2 2 E T P ( Q , k , J , n ) Q * * k * * 2 T C s y s ( Q , P , J , k ) k * * Q * * 2 T C s y s ( Q , P , J , k ) k * * 2 = α β γ 2
α = 2 D + 1 4 ( δ 2 δ 1 ) Q 3 [ ( B b + p m 3 A s n Q ) Φ 2 + A b + A s n + S 0 e r J i n + J ( 1 3 Φ 2 2 Q ) ]
β = 1 2 σ L 1 1 + k 2 3 [ h b + ( ( B b + p m A s n Q ) 1 Q + S 0 e r J i n Q 2 + J Q 2 ) D + 1 4 ( δ 2 δ 1 ) ]
α β = ( 2 D + 1 4 ( δ 2 δ 1 ) Q 3 [ ( B b + p m 3 A s n Q ) Φ 2 + A b + A s n + S 0 e r J i n + J ( 1 3 Φ 2 2 Q ) ] × 1 2 σ L 1 1 + k 2 3 [ h b + ( ( B b + p m A s n Q ) 1 Q + S 0 e r J i n Q 2 + J Q 2 ) D + 1 4 ( δ 2 δ 1 ) ] )
α β = σ L D + 1 4 ( δ 2 δ 1 ) Q 3 1 + k 2 3 [ ( B b + p m 3 A s n Q ) Φ 2 + A b + A s n + S 0 e r J i n + J ( 1 3 Φ 2 2 Q ) ] [ h b + ( ( B b + p m A s n Q ) 1 Q + S 0 e r J i n Q 2 + J Q 2 ) D + 1 4 ( δ 2 δ 1 ) ]
α β = σ L D + 1 4 ( δ 2 δ 1 ) Q 3 1 + k 2 3 [ h b ( B b + p m 3 A s n Q ) Φ 2 + h b A b + A s n + h b S 0 e r J i n + J ( 1 3 Φ 2 2 Q ) + ( ( B b + p m ) 2 Φ 2 Q 4 A s ( B b + p m ) Φ 2 n Q 2 + 3 A s 2 Φ 2 n 2 Q 3 + A b + A s n ( B b + p m A s n Q ) 1 Q + ( B b + p m A s n Q ) S 0 e r J i n + J ( 1 3 Φ 2 2 Q ) 1 Q + S 0 e r J i n Q 2 + J Q 2 ( B b + p m 3 A s n Q ) Φ 2 + S 0 e r J i n Q 2 + J Q 2 A b + A s n + S 0 e r J i n + J 2 ( 1 3 Φ 2 2 Q ) 1 Q 2 ) D + 1 4 ( δ 2 δ 1 ) ]
γ = 1 2 σ L k ( 1 + k 2 ) 1 D + 1 4 ( δ 2 δ 1 ) Q 3 [ Q ( B b + p m 2 A s n Q ) 2 S 0 e r J i n 2 J ]
γ = k ( 1 + k 2 ) 1 2 σ 2 L D + 1 4 ( δ 2 δ 1 ) 2 4 Q 6 [ Q ( B b + p m 2 A s n Q ) 2 S 0 e r J i n + J ] 2
The second principal minor is positive (>0), if
σ L D + 1 4 ( δ 2 δ 1 ) Q 3 1 + k 2 3 [ h b ( B b + p m 3 A s n Q ) Φ 2 + h b A b + A s n + h b S 0 e r J i n + J ( 1 3 Φ 2 2 Q ) + ( ( B b + p m ) 2 Φ 2 Q 4 A s ( B b + p m ) Φ 2 n Q 2 + 3 A s 2 Φ 2 n 2 Q 3 + A b + A s n ( B b + p m A s n Q ) 1 Q + ( B b + p m A s n Q ) S 0 e r J i n + J ( 1 3 Φ 2 2 Q ) 1 Q + S 0 e r J i n Q 2 + J Q 2 ( B b + p m 3 A s n Q ) Φ 2 + S 0 e r J i n Q 2 + J Q 2 A b + A s n + S 0 e r J i n + J 2 ( 1 3 Φ 2 2 Q ) 1 Q 2 ) D + 1 4 ( δ 2 δ 1 ) ] k ( 1 + k 2 ) 1 2 σ 2 L D + 1 4 ( δ 2 δ 1 ) 2 4 Q 6 × Q ( B b + p m 2 A s n Q ) 2 S 0 e r J i n + J 2 0
[ h b ( B b + p m 3 A s n Q ) Φ 2 + h b A b + A s n + h b S 0 e r J i n + J ( 1 3 Φ 2 2 Q ) 1 D + 1 4 ( δ 2 δ 1 ) + ( B b + p m ) 2 Φ 2 Q 4 A s ( B b + p m ) Φ 2 n Q 2 + 3 A s 2 Φ 2 n 2 Q 3 + A b + A s n ( B b + p m A s n Q ) 1 Q + ( B b + p m A s n Q ) S 0 e r J i n + J ( 1 3 Φ 2 2 Q ) 1 Q + S 0 e r J i n Q 2 + J Q 2 ( B b + p m 3 A s n Q ) Φ 2 + S 0 e r J i n Q 2 + J Q 2 A b + A s n + S 0 e r J i n + J 2 ( 1 3 Φ 2 2 Q ) 1 Q 2 ] k ( 1 + k 2 ) 1 2 σ L 1 + k 2 3 4 Q 2 Q ( B b + p m 2 A s n Q ) 2 S 0 e r J i n + J 2 0
Since, for all positive values of k we have
1 + k 2 3 k ( 1 + k 2 ) 1 2 0

References

  1. Sana, S.S. A collaborating inventory model in a supply chain. Econ. Model. 2012, 29, 2016–2023. [Google Scholar] [CrossRef]
  2. Heydari, J.; Zaabi-Ahmadi, P.; Choi, T.M. Coordinating supply chains with stochastic demand by crashing lead times. Comput. Oper. Res. 2018, 100, 394–403. [Google Scholar] [CrossRef]
  3. Moon, I.; Shin, E.; Sarkar, B. Min–max distribution free continuous-review model with a service level constraint and variable lead time. Appl. Math. Comput. 2014, 229, 310–315. [Google Scholar] [CrossRef]
  4. Dey, B.K.; Sarkar, B.; Pareek, S. A Two-Echelon Supply Chain Management with Setup Time and Cost Reduction, Quality Improvement and Variable Production Rate. Mathematics 2019, 7, 328. [Google Scholar] [CrossRef]
  5. Sarkar, B.; Guchhait, R.; Sarkar, M.; Pareek, S.; Kim, N. Impact of safety factors and setup time reduction in a two-echelon supply chain management. Robot. Comput. Integr. Manuf. 2019, 55, 250–258. [Google Scholar] [CrossRef]
  6. Sarkar, B.; Majumder, A. Integrated vendor–buyer supply chain model with vendor’s setup cost reduction. Appl. Math. Comput. 2013, 224, 362–371. [Google Scholar] [CrossRef]
  7. Sarkar, B.; Majumder, A.; Sarkar, M.; Dey, B.K.; Roy, G. Two-echelon supply chain model with manufacturing quality improvement and setup cost reduction. J. Ind. Manag. Optim. 2017, 13, 1085–1104. [Google Scholar] [CrossRef] [Green Version]
  8. Malik, A.I.; Sarkar, B. Optimizing a Multi-Product Continuous-Review Inventory Model With Uncertain Demand, Quality Improvement, Setup Cost Reduction, and Variation Control in Lead Time. IEEE Access 2018, 6, 36176–36187. [Google Scholar] [CrossRef]
  9. Malik, A.I.; Sarkar, B. A Distribution-Free Model with Variable Setup Cost, Backorder Price Discount and Controllable Lead Time. DJ J. Eng. Appl. Math. 2018, 4, 58–69. [Google Scholar] [CrossRef]
  10. Panda, S. Coordinating a manufacturer–retailer chain under time and price dependent demand rate. Int. J. Manag. Sci. Eng. Manag. 2013, 8, 84–92. [Google Scholar] [CrossRef]
  11. Panda, S.; Modak, N.M.; Basu, M. Disposal cost sharing and bargaining for coordination and profit division in a three-echelon supply chain. Int. J. Manag. Sci. Eng. Manag. 2014, 9, 276–285. [Google Scholar] [CrossRef]
  12. Roy, A.; Sana, S.S.; Chaudhuri, K. Effect of cooperative advertising policy for two layer supply chain. Int. J. Manag. Sci. Eng. Manag. 2015, 10, 89–101. [Google Scholar] [CrossRef]
  13. Panda, S.; Modak, N.M.; Pradhan, D. Corporate social responsibility, channel coordination and profit division in a two-echelon supply chain. Int. J. Manag. Sci. Eng. Manag. 2016, 11, 22–33. [Google Scholar] [CrossRef]
  14. Giri, B.C.; Sharma, S. Manufacturer’s pricing strategy in a two-level supply chain with competing retailers and advertising cost dependent demand. Econ. Model. 2014, 38, 102–111. [Google Scholar] [CrossRef]
  15. Saha, S.; Panda, S.; Modak, N.M.; Basu, M. Mail-in-rebate coupled with revenue sharing and downward direct discount for supply chain coordination. Int. J. Oper. Res. 2015, 23, 451–476. [Google Scholar] [CrossRef]
  16. Saha, S.; Goyal, S.K. Supply chain coordination contracts with inventory level and retail price dependent demand. Int. J. Prod. Econ. 2015, 161, 140–152. [Google Scholar] [CrossRef]
  17. Sana, S.S.; Herrera-Vidal, G.; Acevedo-Chedid, J. Collaborative model on the agro-industrial supply chain of cocoa. Cybern. Syst. 2017, 48, 325–347. [Google Scholar] [CrossRef]
  18. Basiri, Z.; Heydari, J. A mathematical model for green supply chain coordination with substitutable products. J. Clean. Prod. 2017, 145, 232–249. [Google Scholar] [CrossRef] [Green Version]
  19. Pal, B.; Sana, S.S.; Chaudhuri, K. Supply chain coordination with random yield and demand uncertainty. Int. J. Manag. Sci. Eng. Manag. 2018, 13, 33–44. [Google Scholar] [CrossRef]
  20. Johari, M.; Hosseini-Motlagh, S. Coordination of cooperative promotion efforts with competing retailers in a manufacturer-retailer supply chain. Uncertain Supply Chain Manag. 2018, 6, 25–48. [Google Scholar] [CrossRef]
  21. Venegas, B.B.; Ventura, J.A. A two-stage supply chain coordination mechanism considering price sensitive demand and quantity discounts. Eur. J. Oper. Res. 2018, 264, 524–533. [Google Scholar] [CrossRef]
  22. Liao, C.J.; Shyu, C.H. An analytical determination of lead time with normal demand. Int. J. Oper. Prod. Manag. 1991, 11, 72–78. [Google Scholar] [CrossRef]
  23. Arkan, A.; Hejazi, S.R. Coordinating orders in a two echelon supply chain with controllable lead time and ordering cost using the credit period. Comput. Ind. Eng. 2012, 62, 56–69. [Google Scholar] [CrossRef]
  24. Glock, C.H. Lead time reduction strategies in a single-vendor–single-buyer integrated inventory model with lot size-dependent lead times and stochastic demand. Int. J. Prod. Econ. 2012, 136, 37–44. [Google Scholar] [CrossRef]
  25. Jha, J.K.; Shanker, K. Single-vendor multi-buyer integrated production-inventory model with controllable lead time and service level constraints. Appl. Math. Model. 2013, 37, 1753–1767. [Google Scholar] [CrossRef]
  26. Soni, H.N.; Sarkar, B.; Mahapatra, A.S.; Mazumder, S.K. Lost sales reduction and quality improvement with variable lead time and fuzzy costs in an imperfect production system. RAIRO Oper. Res. 2018, 52, 819–837. [Google Scholar] [CrossRef] [Green Version]
  27. Chaharsooghi, S.K.; Heydari, J. LT variance or LT mean reduction in supply chain management: Which one has a higher impact on SC performance? Int. J. Prod. Econ. 2010, 124, 475–481. [Google Scholar] [CrossRef]
  28. Ye, F.; Xu, X. Cost allocation model for optimizing supply chain inventory with controllable lead time. Comput. Ind. Eng. 2010, 59, 93–99. [Google Scholar] [CrossRef]
  29. Li, X.; Li, Y.; Cai, X. A note on the random yield from the perspective of the supply chain. Omega 2012, 40, 601–610. [Google Scholar] [CrossRef]
  30. Heydari, J. Lead time variation control using reliable shipment equipment: An incentive scheme for supply chain coordination. Trans. Res. Part E Logist. Trans. Rev. 2014, 63, 44–58. [Google Scholar] [CrossRef]
  31. Scarf, H. A min max solution of an inventory problem. In Studies in the Mathematical Theory of Inventory and Production; Wiley: New York, NY, USA, 1958. [Google Scholar]
  32. Gallego, G.; Moon, I. The distribution free newsboy problem: Review and extensions. J. Oper. Res. Soc. 1993, 44, 825–834. [Google Scholar] [CrossRef]
  33. Moon, I.; Choi, S. TECHNICAL NOTEA note on lead time and distributional assumptions in continuous review inventory models. Comput. Oper. Res. 1998, 5, 1007–1012. [Google Scholar] [CrossRef]
  34. Sarkar, B.; Mandal, B.; Sarkar, S. Quality improvement and backorder price discount under controllable lead time in an inventory model. J. Manuf. Syst. 2015, 35, 26–36. [Google Scholar] [CrossRef]
  35. Udayakumar, R.; Geetha, K.V. Supply chain coordination with controllable lead time under imperfect production process. J. Intell. Fuzzy Syst. 2018, 34, 2003–2019. [Google Scholar] [CrossRef]
  36. Porteus, E.L. Optimal lot sizing, process quality improvement and setup cost reduction. Oper. Res. 1986, 34, 37–44. [Google Scholar] [CrossRef]
  37. Sarker, B.R.; Coates, E.R. Manufacturing setup cost reduction under variable lead times and finite opportunities for investment. Int. J. Prod. Econ. 1997, 49, 237–247. [Google Scholar] [CrossRef]
  38. Huang, C.K.; Cheng, T.L.; Kao, T.C.; Goyal, S.K. An integrated inventory model involving manufacturing setup cost reduction in compound Poisson process. Int. J. Prod. Res. 2011, 49, 1219–1228. [Google Scholar] [CrossRef]
  39. Özekici, S.; Parlar, M. Inventory models with unreliable suppliers in a random environment. Ann. Oper. Res. 1999, 91, 123–136. [Google Scholar] [CrossRef]
  40. Park, K.; Lee, K. Distribution-robust single-period inventory control problem with multiple unreliable suppliers. OR Spectrum. 2016, 38, 949–966. [Google Scholar] [CrossRef]
  41. Na, B.; Lee, J.; Ahn, H.J. Inventory Control by Multiple Service Levels under Unreliable Supplying Condition. Math. Probl. Eng. 2016, 2016, 1534580. [Google Scholar]
  42. Giri, B.C.; Chakraborty, A. Coordinating a vendor-buyer supply chain with stochastic demand and uncertain yield. Int. J. Manag. Sci. Eng. Manag. 2017, 12, 96–103. [Google Scholar] [CrossRef]
  43. Hutchinson, J. Fractals and Self Similarity. Indiana Univ. Math. J. 1981, 30, 713–747. [Google Scholar] [CrossRef]
  44. Melin, P.; Castillo, O. An intelligent hybrid approach for industrial quality control combining neural networks, fuzzy logic and fractal theory. Inf. Sci. 2007, 177, 1543–1557. [Google Scholar] [CrossRef]
  45. Shah, F.; Debnath, L. Wavelet Neural Network Model for Yield Spread Forecasting. Mathematics 2017, 5, 72. [Google Scholar] [CrossRef]
  46. Guido, R.C.; Addison, P.; Walker, J. Introducing wavelets and time-frequency analysis. IEEE Eng. Biol. Med. Mag. 2009, 28, 13. [Google Scholar] [CrossRef] [PubMed]
  47. Guariglia, E. Entropy and fractal antennas. Entropy 2016, 18, 84. [Google Scholar] [CrossRef]
  48. Guido, R.C. Effectively interpretating discrete wavelet transforms signals [Lecture Notes]. IEEE Signal Proc. Mag. 2017, 34, 89–100. [Google Scholar] [CrossRef]
  49. Roberto, B.S.; Alfonsina, L.M.R.; Alexander, B.D.R. Intelligent neuro-fuzzy fabric evaluation system: A novel multi-dimensional stochastic fuzzy system and a generator of training patterns for an artificial neural network. Int. J. Ind. Eng. 2018, 25, 215–229. [Google Scholar]
  50. Guariglia, E. Harmonic Sierpinski gasket and applications. Entropy 2018, 20, 714. [Google Scholar] [CrossRef]
  51. Guariglia, E. Primality, Fractality, and Image Analysis. Entropy 2019, 21, 304. [Google Scholar] [CrossRef]
  52. Silver, E.A.; Pyke, D.F.; Peterson, R. Inventory Management and Production Planning and Scheduling; Wiley: New York, NY, USA, January 1998. [Google Scholar]
  53. Sarkar, B.; Mahapatra, A.S. Periodic review fuzzy inventory model with variable lead time and fuzzy demand. Int. Trans. Oper. Res. 2017, 24, 1197–1227. [Google Scholar] [CrossRef]
  54. Kumar, R.S.; Goswami, A. A continuous review production–inventory system in fuzzy random environment: Minmax distribution free procedure. Comput. Ind. Eng. 2015, 79, 65–75. [Google Scholar] [CrossRef]
  55. Soni, H.N.; Sarkar, B.; Joshi, M. Demand uncertainty and learning in fuzziness in a continuous review inventory model. J. Intell. Fuzzy Syst. 2017, 33, 2595–2608. [Google Scholar] [CrossRef]
  56. Tayyab, M.; Sarkar, B.; Yahya, B. Imperfect Multi-Stage Lean Manufacturing System with Rework under Fuzzy Demand. Mathematics 2019, 7, 13. [Google Scholar] [CrossRef]
  57. Taleizadeh, A.A.; Niaki, S.T.A.; Aryanezhad, M.B.; Shafii, N. A hybrid method of fuzzy simulation and genetic algorithm to optimize constrained inventory control systems with stochastic replenishments and fuzzy demand. Inf. Sci. 2013, 200, 425–441. [Google Scholar] [CrossRef]
  58. Chang, H.C.; Yao, J.S.; Ouyang, L.Y. Fuzzy mixture inventory model with variable lead-time based on probabilistic fuzzy set and triangular fuzzy number. Math. Comput. Model. 2004, 39, 287–304. [Google Scholar] [CrossRef]
  59. Cebi, S.; Ozkok, M.; Kafali, M.; Kahraman, C. A fuzzy multiphase and multicriteria decision-making method for cutting technologies used in Shipyards. Int. J. Fuzzy Syst. 2016, 2016. 18, 198–211. [Google Scholar] [CrossRef]
  60. Taleizadeh, A.A.; Niaki, S.T.A.; Nikousokhan, R. Constraint multiproduct joint-replenishment inventory control problem using uncertain programming. Appl. Soft Comput. 2011, 11, 5143–5154. [Google Scholar] [CrossRef]
  61. Kowalski, K.; Lev, B. On step fixed-charge transportation problem. Omega 2008, 36, 913–917. [Google Scholar] [CrossRef]
  62. Glock, C.H. A multiple-vendor single-buyer integrated inventory model with a variable number of vendors. Comput. Ind. Eng. 2011, 60, 173–182. [Google Scholar] [CrossRef]
  63. Sarkar, B.; Saren, S.; Shin, D.; Hur, S. Effect of unequal lot sizes, variable setup cost, and carbon emission cost in a supply chain model. Math. Probl. Eng. 2015, 2015, 469486. [Google Scholar] [CrossRef]
  64. Sarkar, B.; Tayyab, M.; Choi, S.B. Product Channeling in an O2O Supply Chain Management as Power Transmission in Electric Power Distribution Systems. Mathematics 2019, 7, 4. [Google Scholar] [CrossRef]
Figure 1. The function of cost of reduction in lead-time (CRLT).
Figure 1. The function of cost of reduction in lead-time (CRLT).
Mathematics 07 00480 g001
Table 1. Input data for numerical example.
Table 1. Input data for numerical example.
ParameterProblem 1Problem 2ParameterProblem 1Problem 2
D (units/year)20,00020,000L3080
p ($/unit)2015 σ 59
w ($/unit)1713F 0.3 0.6
m ($/unit)127T20100
S 0 ($/setup)600900M 0.9 0.8
A s ($/order)100100 η 0.5 0.5
A b ($/order)200160r 0.3 0.2
h s ($/unit/year)53 δ 1 150180
h b ($/unit/year)106 δ 2 130100
B b ($/unit/unit time)66 C F T ($/shipment)3015
C S T ($/shipment)208
Table 2. Output data for numerical problem 1, in case of unreliable seller.
Table 2. Output data for numerical problem 1, in case of unreliable seller.
Decision VariableDecentralized SystemCentralized SystemCoordinating System
Q (units)925 1104.8 920.6
S L 95.11 % 94.21 % 95.13 %
n111
s ( k ) 1.56 1.75 1.32
J ($)171717
E P b ($)50,108.7950,411.9350,177.23
E P s ($)97,817.3297,636.1997,489.72
E T P ($)147,926.12147,953.27147,666.95
Table 3. Output data for numerical problem 2, in case of unreliable Seller.
Table 3. Output data for numerical problem 2, in case of unreliable Seller.
Decision VariableDecentralized SystemCentralized SystemCoordinating System
Q (units)11321305 1050.2
S L 95.92 % 95.3 % 96.2 %
n111
s ( k ) 4.07 4.4 1.23
J ($)262617
E P b ($)32,239.132,719.633,209.08
E P s ($)118,122.2117,473.5118,052.03
E T P ($)150,361.2150,057.1151,187.42
Table 4. Output data for numerical problem 1, in case of reliable Seller.
Table 4. Output data for numerical problem 1, in case of reliable Seller.
Decision VariableDecentralized SystemCentralized SystemCoordinating System
Q (units)89411321132
S L 95.3 % 94.1 % 94.1 %
n111
J ($)171717
E P b ($)50,580.050,791.650,633.3
E P s ($)97,739.297,844.597,684.8
E T P ($)148,319.2148,636.1148,318.1
Table 5. Output data for numerical problem 2, in the case of a reliable Seller.
Table 5. Output data for numerical problem 2, in the case of a reliable Seller.
Decision VariableDecentralized SystemCentralized SystemCoordinating System
Q (units)103213921392
S L 96.3 % 95.3 % 95.0 %
n111
J ($)262626
E P b ($)33,167.033,487.433,443.8
E P s ($)117,944.5118,000.3117,956.6
E T P ($)151,111.5151,487.6151,400.04
Table 6. Sensitivity analysis for numerical problem 1, in case of unreliable seller.
Table 6. Sensitivity analysis for numerical problem 1, in case of unreliable seller.
ParameterPercentage Changes (%)Change in Total Profit (%)
Decentralized SystemCentralized System
50 % 0.0267 0.0211
25 % 0.0134 0.0106
S 0 0 % 00
+ 25 % 0.0134 0.0105
+ 50 % 0.0267 0.0211
50 % 0.0556 0.017
25 % 0.0292 0.0122
B b 0 % 00
+ 25 % 0.0323 0.0151
+ 50 % 0.0709 0.0313
50 % 0.7293 0.5982
25 % 0.3646 0.2932
A s 0 % 00
+ 25 % 0.3646 0.2826
+ 50 % 0.7293 0.5557
50 % 1.0079 1.2535
25 % 0.5132 0.5995
A b 0 % 00
+ 25 % 0.5229 0.55667
+ 50 % 1.0186 1.0787
Table 7. Sensitivity analysis for numerical Problem 1, in case of reliable seller.
Table 7. Sensitivity analysis for numerical Problem 1, in case of reliable seller.
ParameterPercentage Changes (%)Change in Total Profit (%)
Decentralized SystemCentralized System
50 % 0.027575665 0.0218
25 % 0.013787832 0.0109
S 0 0 % 00
+ 25 % 0.01378109 0.0108
+ 50 % 0.027568923 0.0217
50 % 0.753712365 0.6191
25 % 0.376856183 0.3030
A s 0 % 00
+ 25 % 0.376849441 0.2914
+ 50 % 0.753705623 0.5725
50 % 1.012667411 1.2986
25 % 0.526452479 0.6191
A b 0 % 00
+ 25 % 0.519683294 0.5725
+ 50 % 1.021378354 1.1075

Share and Cite

MDPI and ACS Style

Malik, A.I.; Sarkar, B. Coordinating Supply-Chain Management under Stochastic Fuzzy Environment and Lead-Time Reduction. Mathematics 2019, 7, 480. https://doi.org/10.3390/math7050480

AMA Style

Malik AI, Sarkar B. Coordinating Supply-Chain Management under Stochastic Fuzzy Environment and Lead-Time Reduction. Mathematics. 2019; 7(5):480. https://doi.org/10.3390/math7050480

Chicago/Turabian Style

Malik, Asif Iqbal, and Biswajit Sarkar. 2019. "Coordinating Supply-Chain Management under Stochastic Fuzzy Environment and Lead-Time Reduction" Mathematics 7, no. 5: 480. https://doi.org/10.3390/math7050480

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop