분해 일정계획 문제에 대한 정수계획 모형

Integer Programming Models for Disassembly Scheduling

  • Lee Dong-Ho (Department of Industiral Engineering Hanyang University) ;
  • Kim Hwa-Joong (Institute of Production and Robotics (STI-lPR-LICP) Swiss Federal Institute of Technology (EPFL) Lausanne) ;
  • Xirouchakis Paul (Institute of Production and Robotics (STI-lPR-LICP) Swiss Federal Institute of Technology (EPFL) Lausanne)
  • 발행 : 2003.05.01

초록

Disassembly scheduling is the problem or determining the ordering and disassembly schedules or used or end-of-life products while satisfying the demand or their parts or components over a certain planning horizon. To represent and optimally solve the basic case. i e ., single product type without parts commonality, an Integer programming model is suggested for the objective or minimizing the sum or purchase, setup, inventory holding, and disassembly operation costs. Then, the basic model is offended to consider the cases or single and multiple product types with parts commonality. Computational experiments done on the examples obtained from the literature show that the integer programming approach suggested in this paper works well.

키워드