Journal of Northeastern University ›› 2013, Vol. 34 ›› Issue (10): 1387-1390.DOI: -

• Information & Control • Previous Articles     Next Articles

Optimization Model and Algorithm for Solving LotSizing Disassembly with Multiresource Constraint

GUO Xiwang, LIU Shixin   

  1. School of Information Science & Engineering, Northeastern University, Shenyang 110819, China.
  • Received:3013-03-07 Revised:3013-03-07 Online:2013-10-15 Published:2013-05-24
  • Contact: GUO Xiwang
  • About author:-
  • Supported by:
    -

Abstract: For the discarded products disassembly of environmentally conscious manufacturing research field, a method to optimize lotsizing disassembly with multiresource constraints was proposed. A mathematical model was established to minimize the time of disassembly, and the software of CPLEX was used to solve this model. Simulation results of several randomly generated problem instances validated the effectiveness of the proposed model, which indicated that the optimal disassembly quantity, the purchase quantity, and whether a component needs to be disassembled could be solved. What’s more, the external demand of each component could be satisfied at the same time. It could be concluded that there exists influence on the difficulty of solving the lotsizing disassembly problem from the indegree and outdegree of nodes and the percentage of common components.

Key words: lotsizing disassembly, multiresource constraints, selective disassembly, optimal method, exact algorithm

CLC Number: