دانلود مقاله ISI انگلیسی شماره 4144
عنوان فارسی مقاله

مدل برنامه ریزی چند هدفه برای انتخاب شریک - دیدگاه هم افزایی عینی و تخصیص منابع

کد مقاله سال انتشار مقاله انگلیسی ترجمه فارسی تعداد کلمات
4144 2010 7 صفحه PDF سفارش دهید محاسبه نشده
خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.
عنوان انگلیسی
A multiobjective programming model for partner selection-perspectives of objective synergies and resource allocations
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Expert Systems with Applications, Volume 37, Issue 5, May 2010, Pages 3530–3536

کلمات کلیدی
- اتحاد استراتژیک - اثر هم افزایی - دیدگاه مبتنی بر منابع - مدل برنامه ریزی چند هدفه - هم افزایی هدف - تخصیص منابع
پیش نمایش مقاله
پیش نمایش مقاله مدل برنامه ریزی چند هدفه برای انتخاب شریک - دیدگاه هم افزایی عینی و تخصیص منابع

چکیده انگلیسی

Strategic alliances are widely used in business to obtain the synergy effect and competitive advantage. On the basis of the resource-based view, it can be seen that the valuable resources of firms provide the motivation for entering into strategic alliances. Therefore, the issue of partner selection plays a critical role in the performance of strategic alliances. Although many mathematical programming models have been proposed to deal with the partner selection problems, two main issues such as objective synergies and resource allocations are seems to be ignored. In this paper, a new multiobjective programming model is proposed to determine the optimal partners in the alliance and the corresponding resource allocations. Furthermore, a numerical example is used to demonstrate the proposed method and compared with the conventional method. From the results, it can be concluded that objective synergies and resource allocations play a significant role in the problem of partner selection and should not be ignored in the realistic alliance’s problems.

مقدمه انگلیسی

The problem of partner selection is related to coalition formation that can be defined by a cooperative arrangement between two or more independent firms that exchange or share resources for competitive advantage. Since the 1980s, the problem of partner selection has been widely addressed in the contexts of strategic alliances (Auster, 1994, Harrigan and Newman, 1990 and Porter and Fuller, 1986) and supply chain management (Garg et al., 2006 and Olhager and Selldin, 2004). The essential motivation of partner selection can be described as “synergy effects” and be represented by using the following equation: where v(·)v(·) denotes the value/satisfaction function and sksk denotes the kth alliance partner. It can be seen that Eq. (1) can be interpreted as the value of alliance is larger than the summation of individual firms. Thus, when Eq. (1) is satisfied, alliance firms can share more value (e.g., profit, or market share) than their original states through coalition formation. When some firms rush into alliances without appropriate preparation, i.e., decision making is under the situation that being lack of information to choose the correct partners and the way to allocate the corresponding resource, these alliances often fail (Dacin, Hitt, & Levitas, 1997). In fact, the questions above are usually complex and diversified, i.e. with the different firm’s goals, culture, and resources, the best alliance partners and the corresponding resource allocations may be quite diverse. In order to determine the correct partners for increasing competitive advantage, many mathematical programming models, such as linear programming (Anthony and Buffa, 1977 and Pan, 1989), mixed-integer programming (Bendor et al., 1985 and Kasilingam and Lee, 1996), stochastic integer programming (Feng, Wang, & Wang, 2001), and goal programming (Buffa and Jackson, 1983, Karpak et al., 1999 and Sharma et al., 1989), are widely employed. It can be seen that for a specific firm, by setting the appropriate objectives, the optimal alliance partners can be determined by solving the following multiobjective programming (MOP) model: where fj(x)fj(x) denotes the jth objective of the alliance, View the MathML sourcefje(x) denotes the jth objective of the specific firm, View the MathML sourcefji(x) denotes the jth objective of the ith candidate partner, si∈{0,1}si∈{0,1} is a dummy variable, where 1 indicates the ith candidate partner is selected to be the partner, View the MathML sourcegje(x) and View the MathML sourcegji(x) denote the jth technological constraint of the specific firm and the ith candidate partner, respectively, View the MathML sourcebje and View the MathML sourcebji denote the jth limited resource of the specific firm and the ith candidate partner, respectively, and k denotes the number of alliance partners. Note that the “appropriate objectives” above may be quality, lead-time, profit, and customer satisfaction. In spite of the mathematical programming model has been successfully employed to deal with various problems of partner selection, such as virtual Enterprise (Ip, Huang, Yung, & Wang, 2003), and international joint ventures (Hajidimitriou & Georgiou, 2002), two main issues, called objective synergies and resource allocations, should be highlighted so that the model above can deal well with the realistic problem of partner selection. Objective synergies of the alliance can be defined by ∂fi(x)/∂fj(x)>0∂fi(x)/∂fj(x)>0 and can be interpreted as the objective levels of the jth alliance are positively related to the objective levels of the ith alliance. That is, when the value of the jth alliance’ objective level increase, it will also trigger the value of objective level of the ith alliance increase. On the other hand, since the boundary of firms has be broken via alliance, the alliance’s resources should be reallocated and rearranged for achieving the optimum. However, due to the restriction of objective independence and fixed limited resources in the traditional MOP model, the model above (Eq. (2)) cannot incorporate these two important issues, objective synergies and resource allocations, to select the correct partners and reallocate alliance’s resources. In this paper, a new multiobjective programming model is developed so that the objective synergies and resource allocations of the alliance can be considered to determine the correct alliance partners and the corresponding resource reallocations in this model. In addition, a numerical example is used to demonstrate the proposed method and compared with the conventional MOP method. On the basis of the results, it can be concluded that the objective synergies between alliances and the resource allocations of alliances are quite significant and should not be ignored in the problem of determining the optimal partner selection in alliances. The reminder of this paper is organized as follows. Objective synergies and resource allocations in the problem of partner selection is discussed in Section 2. A new multiobjective programming is proposed in Section 3 to incorporate the issues of objective synergies and resource allocations in the partner selection problem. In Section 4, a numerical example is used to demonstrate the proposed method and compare with the conventional MOP model. Section 6 presents a discussion of the numerical example and conclusions are in the last section.

نتیجه گیری انگلیسی

It is clear that partner selection plays a critical issue in formulating successful alliances. Although considerable studies have employed mathematical programming to deal with this problem, the conventional MOP method seems to ignore the problems of objective synergies and resource allocations in alliances. In this paper, a new MOP model is developed to determine the correct alliance partners and the corresponding resource allocations by incorporating objective synergies. On the basis of the numerical results, we can conclude that objective synergies and resource allocations play a significant role in the satisfaction level of alliances and should not be simply ignored. Therefore, the proposed model should be more suitable for solving the realistic partner selection problem than the conventional MOP model does.

خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.