期刊
MATHEMATICS
卷 11, 期 2, 页码 -出版社
MDPI
DOI: 10.3390/math11020298
关键词
reverse logistics; remanufacturing; EOL product; combinational optimization
类别
This paper provides a comprehensive review and summary of combinatorial optimization problems (COPs) in reverse logistics (RL) and remanufacturing processes. Typical COPs at the end of the product life cycle are discussed and analyzed for the first time. A total of 160 papers published since 1992 are selected and categorized into three modules: facility location and vehicle routing in RL, scheduling in remanufacturing, and disassembly in remanufacturing. Existing research gaps are identified and possible directions are described.
During the end-of-life (EOL) product recovery process, there are a series of combinatorial optimization problems (COPs) that should be efficiently solved. These COPs generally result from reverse logistics (RL) and remanufacturing, such as facility location and vehicle routing in RL, and scheduling, planning, and line balancing in remanufacturing. Each of the COPs in RL and remanufacturing has been reviewed; however, no review comprehensively discusses and summarizes the COPs in both. To fill the gap, a comprehensive review of the COPs in both RL and remanufacturing is given in this paper, in which typical COPs arising at the end of the product life cycle are discussed and analyzed for the first time. To better summarize these COPs, 160 papers published since 1992 are selected and categorized into three modules: facility location and vehicle routing in RL, scheduling in remanufacturing, and disassembly in remanufacturing. Finally, the existing research gaps are identified and some possible directions are described.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据