A robust block-chain based tabu search algorithm for the dynamic lot sizing problem with product returns and remanufacturing

Abstract

This paper studies the dynamic lot sizing problem with product returns and remanufacturing (DLRR). Given demands and returns over a planning horizon, DLRR is to determine a production schedule of manufacturing new products and/or remanufacturing returns such that demand in each period is satisfied and the total cost (set-up cost plus holding cost of… (More)

Topics

8 Figures and Tables

Cite this paper

@inproceedings{Li2013ARB, title={A robust block-chain based tabu search algorithm for the dynamic lot sizing problem with product returns and remanufacturing}, author={Xiangyong Li and Fazle Baki and Peng Tian and Ben A. Chaouch}, year={2013} }