Conference Paper

An Optimal Algorithm for Disassembly Scheduling with Assembly Product Structure.

DOI: 10.1007/11551263_20 Conference: KI 2005: Advances in Artificial Intelligence, 28th Annual German Conference on AI, KI 2005, Koblenz, Germany, September 11-14, 2005, Proceedings
Source: DBLP

ABSTRACT This paper considers the problem of determining the quantity and timing of disassembling used or end-of-life products in order
to satisfy the demand of their parts or components over a finite planning horizon. We focus on the case of single product
type without parts commonality, i.e., assembly product structure. The objective is to minimize the sum of setup, disassembly
operation, and inventory holding costs. Several properties of optimal solutions are derived, and then a branch and bound algorithm
is developed based on the Lagrangian relaxation technique. Results of computational experiments on randomly generated test
problems show that the algorithm finds the optimal solutions in a reasonable amount of computation time.

0 Bookmarks
 · 
23 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present an algorithm for scheduling the disassembly of discrete parts products characterized by a well defined product structure. As opposed to MRP where the demand occurs at the end item level, the demand in the disassembly case is motivated by the component level of the product structure. Even though the objective in the disassembly case is the reverse of that of MRP, the algorithm itself is not the reverse of the MRP algorithm. It is considerably more complicated. An example is presented and its implementation in a spreadsheet is described.
    International Journal of Production Research - INT J PROD RES. 01/1994; 32(8):1857-1866.
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper considers the application of Petri nets with timestamps to the problem of disassembly scheduling with parts commonality, which is the problem of determining time and quantity of ordering the used product to fulfill the demands of individual disassembled parts. Unlike the simple case, parts commonality creates dependencies of components and makes them difficult to solve. A comparison of methods using an example problem from a previous research shows that the method suggested in this paper is much simpler and more extendable than the previous one. Also, we show that the solutions obtained from the previous algorithm are not optimal in general.
    Fundam. Inform. 01/2001; 47:295-306.
  • [Show abstract] [Hide abstract]
    ABSTRACT: A multi-stage assembly system is a special case of Veinott's general multi-facility system in that each facility may have any number of predecessors but at most a single successor. This paper presents two algorithms for computing optimal lot sizes in such systems with known time-varying demand. The first is a dynamic programming algorithm for which solution time increases exponentially with the number of time periods, but only linearly with the number of stages, irrespective of assembly structure. The second is a branch and bound algorithm intended for cases where the number of time periods is large but the structure is close to serial. Computational results are given and extensions considered.
    Management Science. 01/1973; 20(1):14-21.