z-logo
open-access-imgOpen Access
Design of demand driven return supply chain for high-tech products
Author(s) -
J. Ashayeri,
Gülfem Tuzkaya
Publication year - 2011
Publication title -
journal of industrial engineering and management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.385
H-Index - 29
eISSN - 2013-8423
pISSN - 2013-0953
DOI - 10.3926/jiem.2011.v4n3.p481-503
Subject(s) - reverse logistics , analytic hierarchy process , dynamism , computer science , high tech , task (project management) , supply chain , analytic network process , network planning and design , operations research , process (computing) , industrial engineering , systems engineering , engineering , business , marketing , physics , quantum mechanics , political science , law , operating system , computer network
Purpose: The purpose of this study is to design a responsive network for after-sale services of high-tech products. Design/methodology/approach: Analytic Hierarchy Process (AHP) and weighted max-min approach are integrated to solve a fuzzy goal programming model. Findings: Uncertainty is an important characteristic of reverse logistics networks, and the level of uncertainty increases with the decrease of the products’ life-cycle. Research limitations/implications: Some of the objective functions of our model are simplified to deal with non-linearities. Practical implications: Designing after-sale services networks for high-tech products is an overwhelming task, especially when the external environment is characterized by high levels of uncertainty and dynamism. This study presents a comprehensive modeling approach to simplify this task. Originality/value: Consideration of multiple objectives is rare in reverse logistics network design literature. Although the number of multi-objective reverse logistics network design studies has been increasing in recent years, the last two objective of our model is unique to this research area

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here