摘要：AbstractIn this study, we consider the stochastic dynamic disassembly assembly routing problem with returns (2DARP-R), where the yields are uncertain due to the unknown situation of returned products. We introduce the formulation of the robust 2DARP-R defined by discrete scenarios. We address five hypotheses, where different levels of decision flexibility are given. Results show that allowing flexibility in the procurement process improves significantly the total cost with an average deviation equal to 11.24% for instances with 5 scenarios, 8.70% for instances with 10 scenarios and 7.06% for instances with 20 scenarios.
关键词：KeywordsAssemblydisassemblyrouting problem with returnsyields uncertaintydiscrete scenariosinteger programming
