Multi-objective bi-level supply chain network order allocation problem under fuzziness

In this paper we addressed supply chain network (SCN) as bi-level programming problem in which the primary objective is to determine optimal order allocation of products where the customer’s demands and supply for the products are fuzzy. In the proposed SCN model, we suppose that the first level (le...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Opsearch Ročník 55; číslo 3-4; s. 721 - 748
Hlavní autoři: Gupta, Srikant, Ali, Irfan, Ahmed, Aquil
Médium: Journal Article
Jazyk:angličtina
Vydáno: New Delhi Springer India 01.11.2018
Springer Nature B.V
Témata:
ISSN:0030-3887, 0975-0320
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper we addressed supply chain network (SCN) as bi-level programming problem in which the primary objective is to determine optimal order allocation of products where the customer’s demands and supply for the products are fuzzy. In the proposed SCN model, we suppose that the first level (leader) and second level (follower) operate two separate groups of SCN. The leader, who moves first, determines quantities shipped to retailers, and then, the follower decides his quantities rationally. The leader’s objective is to minimize the total transportation costs, and similarly, the follower’s objective is to minimize the total delivery time of the SCN and at the same time balancing the optimal order allocation from each source, plant, retailer and warehouse respectively. The fuzzy goal programming approach has been used to achieve the highest degree of the membership goals by minimizing the deviational variables so that most satisfactory or the preferred solution for both the levels to be obtained. A numerical example is given to demonstrate the proposed methodology.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0030-3887
0975-0320
DOI:10.1007/s12597-018-0340-2