Skip to content
naulon
Not checkedNot checked for notices yet.

Hybrid Model of IVFRN-BWM and Robust Goal Programming in Agile and Flexible Supply Chain, a Case Study: Automobile Industry

Ayad Hendalianpour, Mahnaz Fakhrabadi, Xiaobo Zhang and 4 more

IEEE Access · 2019

doi:10.1109/access.2019.2915309 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The main purpose of this paper is the allocation of orders to suppliers in an agile and flexible manner suitable to the automobile industry. In this paper, parts supplied by a single source were eliminated from the set of parts. Using mathematical modeling and through the interval-valued fuzzy-rough numbers best worst method (IVFRN-BWM), we try to achieve the results that can meet the proposed model's needs and provide the ideal results by introducing new modes. This paper addressed some new aspects of the subject and achieved robust results by considering five objective functions. These five functions are as follows: minimization of production line disruptions due to the performance of suppliers, minimization of the complaints of production line about supplied parts, minimization of defective parts received from suppliers (PPM), maximization of on-time delivery services, and minimization of overall costs of supplied parts. Reviewing the literature, the originality of this study are as follows: 1) identifying the structure of a supply chain (SC) in general and particularly in an automobile industry SC; 2) investigating the modeling techniques of the existing SC models for coordinating all the members of a product SC; 3) building a hybrid model of IVFRN-BWM and a robust goal programming agile and flexible supply chain in an uncertain situation; and 4) identifying the suitable scenarios/cases for testing the proposed models to validate the models. This paper can help decision makers and managers to opt for the best suppliers and also allocate the right numbers of parts to those supplier(s) based on a real situation of each firm.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.