Sustainable supplier selection and order allocation under operational and disruption risks

2018 ◽  
Vol 174 ◽  
pp. 1351-1365 ◽  
Author(s):  
F. Vahidi ◽  
S. Ali Torabi ◽  
M.J. Ramezankhani
Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 137 ◽  
Author(s):  
Sonia Mari ◽  
Muhammad Memon ◽  
Muhammad Ramzan ◽  
Sheheryar Qureshi ◽  
Muhammad Iqbal

Modern supply chains are vulnerable to high impact, low probability disruption risks. A supply chain usually operates in such a network of entities where the resilience of one supplier is critical to overall supply chain resilience. Therefore, resilient planning is a key strategic requirement in supplier selection decisions for a competitive supply chain. The aim of this research is to develop quantitative resilient criteria for supplier selection and order allocation in a fuzzy environment. To serve the purpose, a possibilistic fuzzy multi-objective approach was proposed and an interactive fuzzy optimization solution methodology was developed. Using the proposed approach, organizations can tradeoff between cost and resilience in supply networks. The approach is illustrated using a supply chain case from a garments manufacturing company.


Mathematics ◽  
2018 ◽  
Vol 6 (12) ◽  
pp. 325 ◽  
Author(s):  
Jong Soo Kim ◽  
Eunhee Jeon ◽  
Jiseong Noh ◽  
Jun Hyeong Park

We consider a buyer’s decision problem of sustainable supplier selection and order allocation (SSS & OA) among multiple heterogeneous suppliers who sell multiple types of items. The buyer periodically orders items from chosen suppliers to refill inventory to preset levels. Each supplier is differentiated from others by the types of items supplied, selling price, and order-related costs, such as transportation cost. Each supplier also has a preset requirement for minimum order quantity or minimum purchase amount. In the beginning of each period, the buyer constructs an SSS & OA plan considering various information from both parties. The buyer’s planning problem is formulated as a mathematical model, and an efficient algorithm to solve larger instances of the problem is developed. The algorithm is designed to take advantage of the branch-and-bound method, and the special structure of the model. We perform computer experiments to test the accuracy of the proposed algorithm. The test result confirmed that the algorithm can find a near-optimal solution with only 0.82 percent deviation on average. We also observed that the use of the algorithm can increase solvable problem size by about 2.4 times.


2019 ◽  
Vol 127 ◽  
pp. 734-748 ◽  
Author(s):  
Elham Esmaeili-Najafabadi ◽  
Mohammad Saber Fallah Nezhad ◽  
Hamid Pourmohammadi ◽  
Mahboobeh Honarvar ◽  
Mohammad Ali Vahdatzad

Sign in / Sign up

Export Citation Format

Share Document