A relax-and-fix heuristic approach for the capacitated dynamic lot sizing problem in integrated manufacturing/remanufacturing systems

作     者：Roshani A. Giglio D. Paolucci M. 

作者机构：Department of Informatics Bioengineering Robotics and Systems Engineering (DIBRIS) University of Genova Via Opera Pia 13 Genova 16145 Italy Department of Mechanical Energy Management and Transportation Engineering (DIME) University of Genova Via Opera Pia 15 Genova 16145 Italy 

出 版 物：《IFAC-PapersOnLine》 

年 卷 期：2017年第50卷第1期

页      面：9008-9013页

主　　题：Capacitated lot sizing fix heuristic Optimization Production planning Relax Remanufacturing 

摘      要：In this paper, the capacitated dynamic lot sizing problem in integrated manufac-turing/remanufacturing systems is addressed. These kinds of production systems are designed to satisfy the demands of different classes of single-level products not only by manufacturing raw materials, but also by remanufacturing returned products. A single machine with a limited capacity in each time period is used to perform both the manufacturing and remanufacturing operations. A mathematical programming formulation is proposed to optimally solve this problem. Since the problem is NP-hard (it is a generalized version of the classical capacitated dynamic lot sizing problem), a relax-and-fix heuristic is developed to solve the problem in a reasonable amount of time. To evaluate the efficiency of the proposed algorithm, some experimental instances are generated and solved. The obtained results show the effectiveness of the proposed algorithm. © 2017