A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints

This paper considers the problem of determining the disassembly schedule (quantity and timing) of products in order to satisfy the demand of their parts or components over a finite planning horizon. The objective is to minimize the sum of set-up, disassembly operation, and inventory holding costs. As an extension of the uncapacitated versions of the problem, we consider the resource capacity restrictions over the planning horizon. An integer program is suggested to describe the problem mathematically, and to solve the problem, a heuristic is developed using a Lagrangean relaxation technique together with a method to find a good feasible solution while considering the trade-offs among different costs. The effectiveness of the algorithm is tested on a number of randomly generated problems and the test results show that the heuristic suggested in this paper can give near optimal solutions within a short amount of computation time.

[1]  Paul Xirouchakis,et al.  Optimal Disassembly Sequencing with Sequence-Dependent Operation Times Based on the Directed Graph of Assembly States , 2002 .

[2]  Ajd Fred Lambert,et al.  Disassembly sequencing: A survey , 2003 .

[3]  Surendra M. Gupta,et al.  Disassembly of complex product structures with parts and materials commonality , 1997 .

[4]  P. Xirouchakis,et al.  Disassembly scheduling: Integer programming models , 2004 .

[5]  G. Boothroyd,et al.  Design for Assembly and Disassembly , 1992 .

[6]  A. H. Redford,et al.  Design for Assembly , 1983, Methods and Tools for Computer Integrated Manufacturing.

[7]  Dong-Ho Lee,et al.  Disassembly planning and scheduling: Review and further research , 2001 .

[8]  Marco Santochi,et al.  Computer Aided Disassembly Planning: State of the Art and Perspectives , 2002 .

[9]  W. Eversheim,et al.  A Key Issue in Product Life Cycle: Disassembly , 1993 .

[10]  Dong-Ho Lee,et al.  A two-stage heuristic for disassembly scheduling with assembly product structure , 2004, J. Oper. Res. Soc..

[11]  Jean-Louis Goffin,et al.  On convergence rates of subgradient optimization methods , 1977, Math. Program..

[12]  H. Kaebernick,et al.  State of the Art Literature Survey on Disassembly Planning , 1998 .

[13]  Gunther Reinhart,et al.  Automated Assembly of Mechatronic Products , 2002 .

[14]  Albert P. M. Wagelmans,et al.  Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..

[15]  Paul Xirouchakis,et al.  Disassembly Scheduling with Capacity Constraints , 2002 .

[16]  P. Xirouchakis,et al.  Two-phase heuristic for disassembly scheduling with multiple product types and parts commonality , 2006 .

[17]  P. Xirouchakis,et al.  Disassembly Scheduling with Multiple Product Types , 2003 .

[18]  Surendra M. Gupta,et al.  Disassembly of multiple product structures , 1997 .

[19]  Paul Xirouchakis,et al.  Disassembly sequencing with imprecise data: A case study , 2003 .

[20]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[21]  P. Xirouchakis,et al.  Modelling and evaluating product end-of-life options , 2001 .

[22]  Dong-Ho Lee,et al.  Parallel disassembly sequencing with sequence-dependent operation times , 2001 .

[23]  Dong-Ho Lee,et al.  Disassembly Scheduling with Parts Commonality Using Petri Nets with Timestamps , 2001, Fundam. Informaticae.

[24]  Dong-Ho Lee Disassembly Scheduling for Products with Assembly Structure , 2005 .