از رقابت تا شبکه های عرضه همکاری: یک مطالعه شبیه سازی
|کد مقاله||سال انتشار||تعداد صفحات مقاله انگلیسی||ترجمه فارسی|
|10054||2011||11 صفحه PDF||سفارش دهید|
نسخه انگلیسی مقاله همین الان قابل دانلود است.
هزینه ترجمه مقاله بر اساس تعداد کلمات مقاله انگلیسی محاسبه می شود.
این مقاله تقریباً شامل 6744 کلمه می باشد.
هزینه ترجمه مقاله توسط مترجمان با تجربه، طبق جدول زیر محاسبه می شود:
- تولید محتوا با مقالات ISI برای سایت یا وبلاگ شما
- تولید محتوا با مقالات ISI برای کتاب شما
- تولید محتوا با مقالات ISI برای نشریه یا رسانه شما
پیشنهاد می کنیم کیفیت محتوای سایت خود را با استفاده از منابع علمی، افزایش دهید.
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Applied Mathematical Modelling, , Volume 35, Issue 3, March 2011, Pages 1054-1064
In a scenario where a vendor books its manufacturing capacity options to multiple retailers it is not unlikely that the vendor runs out of capacity and then it cannot serve more orders until future periods of time. This paper suggests that, once the vendor becomes a bottleneck for the network, it is possible to apply negotiation policies between the different retailers to allow re-allocation of options and then overcome this loose/loose situation. Two simple policies to carry out bookings through negotiation practices, allowing partial bookings and not allowing them, are presented in this study. The effectiveness of this approach is tested with a series of simulation experiments whose main results demonstrate that application of negotiation practices within the network when the vendor has not more available capacity to be booked leads to improve the service level, the overall profit and to diminish the sales opportunity cost.
Nowadays, it is not an unusual business practice that an enterprise not only sells its products/services to one or several buyers but also that such a producer allows manufacturing/service capacity bookings by its customers. These capacity bookings take place in advance and buyers, by paying a certain price, get the option of exercising them in the future. Decisions about how much from the available capacity should be offered to the market and both booking and exercising prices have been intensively discussed ,  and . In this context, an enterprise might fix, for a certain period of time, a determined and constant amount of capacity to be booked, which may turn out to be insufficient to meet the demand. Such a demand is not known in advance and lumpy in many occasions , which make capacity booking decisions even more difficult to be taken. Collaborative and co-operation relationships, especially those regarding supply chain information sharing between the vendor and the retailers do help to overcome these problems ,  and . There are many supply chain co-ordination frameworks in the literature. Li and Wang  carried out a review of co-ordination mechanisms of supply chain, stating that the main decentralized models can be classified into deterministic and stochastic ones. The former can be also broken down into quantity discount models ,  and  and profit-sharing models  and . On the other hand, the main stochastic models are the so-called game models. Among these game theory models, Cachon  developed a Nash equilibrium solution to select inventory policies in a two echelons supply chain with one supplier and N retailers. Esmaeili et al.  model the relationships between seller and buyer following both non-cooperative and cooperative games. The non-cooperative game was based on the Stackelberg model considering separately the case when the seller is the leader (Seller-Stackelberg) and also when the buyer is the leader (Buyer-Stackelberg). Cai et al.  studied how advanced strategies affect the interactions between the supply chain members, considering multiple buyers by introducing a demand function under uncertainty. Zhao et al. , Bauso et al. , Yang and Zhou  and Nagarajan  also developed game theory models applied to one single supply chain in order to improve co-ordination activities within the supply chain. From a supply chain optimization point of view, Silva et al.  developed a supply chain ant colony optimization for modeling supply chain distributed actors. All the developed supply chain co-ordination frameworks aim to improve the whole supply chain performance and, extensively, the individual members’ one. However, most of these frameworks were developed to be applied to one single supply chain dealing with win/win relationships. However, there is a special scenario that goes beyond this win/win supply chain/network relationships and that, initially, it is far more difficult to handle. This scenario is characterized by the situation when there are several supply chains competing for limited resources supplied from the same vendor, who therefore forms part of all these different supply chains at the same time. In this particular case, the relationships established between the different retailers are of a win/lost nature, as the common vendor has got limited capacity to be booked. If the vendor runs out of manufacturing capacity it becomes a bottleneck that automatically rejects all further order bookings it receives. This would be a lose/lose situation for both the vendor and the retailers, as the former assumes an opportunity cost and the latter has to wait until the next period of time when the vendor will have again available capacity to be booked. In this point, the situation could drift away to become an indirect win/win one, with the vendor playing a broker role with the different retailers, trying to re-allocate capacity already booked to others vendors of the network to serve an actual order. Then, if the vendor succeeds in such a negotiation process, a money transfer will be made from the buyer–retailer to the seller–retailer passing through the vendor, who will get a commission of the price paid from the buyer–retailer to the seller–retailer for giving up its booked options. It is important to point out that such a negotiation process takes place before the real demand occurs and that this paper will deal only with booking options and not considering the case when the real demand is known and then the retailers may want to exercise their options. Then, the results of the study pretend to provide some light to the task of whether negotiation process in this context, before the demand is known and decisions to be made under a higher degree of uncertainty, will outcome higher profits for both the vendor and the overall network or not. Fig. 1 illustrates the vendor–retailers relationships lifecycle in function of the vendor’s amount of available capacity and the vendor’s/network overall profit. The following three main trams regarding the type of relationship between the vendor and the retailers can be identified (see Fig. 1): A. Win/win relationship. The vendor’s/network overall profit increases while there is enough capacity to be booked by the different retailers. In this case, the retailers pay to the vendor for booking its capacity. B. Lose/lose relationship. When the vendor has booked all its available capacity to the different retailers the vendor’s/network overall profit decreases to zero. C. Indirect win/win relationship. The vendor’s/network overall profit increases as a consequence of capacity re-allocation activities through negotiation processes between retailers and managed by the vendor. In this situation, the vendor makes certain profit as a consequence of playing the broker role and, similarly, there is a transfer of money between the different retailers that results in an increment of the vendor’s/network overall profit. Fig. 1 is illustrative and it aims to provide a graphical overview of the relationships that take place in this network and to situate the point where, depending of whether negotiation processes take place between the vendor and some retailers or not, the vendor’s/network overall profit will increase or not. Such a point is represented in Fig. 1 with the name of “decision point”. Then, from such a “decision point”, if negotiations processes take place and capacity relocation is made, then the situation represented in Fig. 1 by C will come up; otherwise, the situation represented by B is achieved. This paper aims to demonstrate that the vendor, by managing negotiation processes between the retailers when capacity becomes a bottleneck, can improve its overall profit and establish with its retailers a (indirect) win/win relationship that would replace the traditional lose/lose one. To do so, we consider a scenario consisting of one vendor that has got a log of capacity available to be booked in advance for several retailers. In this two-echelon supply chain network, each buyer orders the amount of capacity that it wants to book from the vendor individually. No connection with others buyers is supposed initially. In the case that the vendor runs out of capacity to be booked, this triggers the negotiation process that will be managed by the vendor and will imply indirect contact and collaboration between the buyer–retailer and the potential candidate seller–retailers. It is assumed that the vendor is the sole supplier of manufacturing capacity to the buyers, backordering is not allowed so is not possible for the vendor to get capacity from external entities. As mentioned above, a lack of capacity to be booked from the vendor will ceteris paribus definitely lead to profit network loss. Then the vendor might be willing to look for capacity from other retailers of the network who may accept to sell it. This particular negotiation scenario may be broken down into two main sub-scenarios, one where the retailer that places the order for manufacturing capacity is willing to accept partial bookings and another when it is not. Therefore, this study develops two negotiation policies, one for each of these sub-scenarios. Then, in order to determine the efficiency of these negotiation policies, we derive several simulation experiments that assess different scenarios taking into account the numbers of buyers in the network, the degree of order variability and the degree of the order urgency.
نتیجه گیری انگلیسی
This paper has simulated the effects, according to different criteria, of two different negotiation approaches to be applied on a real business scenario where one vendor books in advance, and before the real demand occurs, its manufacturing capacity to several retailers and it becomes a bottleneck for the network when it runs out of capacity to be booked. For this, different simulation experiments based on the number of buyers, the order size variability and the order urgency have been carried out. The main results of this research show that, in general, all the three performance measures chosen for this study – vendor profit, vendor service level and vendor sales opportunity cost – offer better results when the negotiation policies are applied than when no negotiation is carried out. An important finding of this study is that the most important factors to take into account are the policies applied for the negotiation and the number of buyers, being the others two factors analysed, order size variability and order urgency, less relevant. Further, for a reduced number of buyers in the network the policy of negotiation with partial bookings offers the best results for the vendor’s profit and service level. Besides, not unexpectedly, the sales opportunity cost can be mitigated as much as of triple when applying negotiation processes that when not. Consequently, this exploratory study has demonstrated that a policy of negotiation allowing partial bookings would return, under the considered conditions, the highest returns to the vendor and, extensively, to the network, making possible to progress beyond the stagnation point traditionally reached when a vendor runs out of capacity to offer to its retailers. The paper tried to map a simple situation when one company (vendor) takes part in several supply chains, which might compete with each other. The complexity of the network and the parameters of the process are limited with respect to real-world situations. Nevertheless, the approach described here might be one starting point for further studies dealing with this problem which can be found in practical settings rather often.