×

Disassembly scheduling: Literature review and future research directions. (English) Zbl 1128.90396

Summary: Disassembly scheduling, one of the important operational problems in disassembly systems, can be generally defined as the problem of determining the quantity and timing of the end-of-use/life products while satisfying the demand of their parts over a planning horizon. This paper presents a literature review on this planning problem in disassembly systems. First, the basic form of the problem is defined with a mathematical formulation. To characterize the differences between assembly and disassembly processes, the effects of the divergence property are also explained with respect to the zero inventory property, indispensable surplus inventory, and mathematical representation. Then, we review the existing research articles on the basic problem and its generalizations. A systematic scheme for classifying problems is also suggested. Finally, we suggest several future research directions.

MSC:

90B30 Production models
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1016/j.ejor.2004.01.054 · Zbl 1077.90001
[2] DOI: 10.1108/01443579410066767
[3] Clegg, AJ, Williams, DJ and Uzsoy, R. 1995. Production planning for companies with remanufacturing capability. Proceedings of the IEEE Symposium on Electronics and the Environment. 1995, Orlando, Florida, USA. pp.186–191.
[4] DOI: 10.1287/mnsc.20.1.14 · Zbl 0304.90039
[5] Golany B, IIE Trans. 33 pp 995– (2001)
[6] DOI: 10.1016/S0360-8352(99)00167-9
[7] DOI: 10.1080/00207549408957046 · Zbl 0896.90118
[8] DOI: 10.1007/s00291-005-0007-2 · Zbl 1122.90010
[9] DOI: 10.1016/S0007-8506(07)62530-X
[10] Kang J-G, Int. J. Indust. Eng. 10 pp 407– (2003)
[11] Kang J-G, J. Korean Inst. Indust. Eng. 28 pp 264– (2002)
[12] DOI: 10.1016/S0007-8506(07)62136-2
[13] DOI: 10.1243/09544054JEM596
[14] DOI: 10.1016/S0305-0483(03)00059-8
[15] DOI: 10.1016/S0007-8506(07)60611-8
[16] DOI: 10.1080/00207540500244443
[17] DOI: 10.1057/palgrave.jors.2602094 · Zbl 1123.90014
[18] Kim, H-J, Lee, D-H and Xirouchakis, P. 2006c. ”A polynomial exact algorithm for two-level disassembly scheduling”. Technical Report, Institute of Production and Robotics, Swiss Federal Institute of Technology, Lausanne (EPFL) · Zbl 1123.90014
[19] Kim, H-J, Lee, D-H and Xirouchakis, P. 2006d. ”A branch and bound algorithm for disassembly scheduling with assembly product structure”. Technical Report, Institute of Production and Robotics, Swiss Federal Institute of Technology, Lausanne (EPFL) · Zbl 1156.90365
[20] DOI: 10.1243/09544054JEM349
[21] DOI: 10.1016/S0360-8352(98)00028-X
[22] DOI: 10.1142/S0960313102000345
[23] DOI: 10.1016/j.omega.2005.01.006
[24] DOI: 10.1080/0020754031000120078 · Zbl 1059.90055
[25] DOI: 10.1142/S0960313102000436
[26] Lambert AJD, Disassembly Modeling for Assembly, Maintenance, Re-use and Recycling (2005)
[27] DOI: 10.1016/j.cor.2005.03.013 · Zbl 1109.90012
[28] DOI: 10.1287/mnsc.38.8.1201 · Zbl 0761.90062
[29] Lee D-H, Int. J. Manage. Sci. 11 pp 63– (2005)
[30] DOI: 10.1243/0954405011518629
[31] DOI: 10.1243/0954405042323586
[32] DOI: 10.1057/palgrave.jors.2601690 · Zbl 1095.90048
[33] DOI: 10.1016/S0007-8506(07)61543-1
[34] Li Y, OR Spectrum 28 pp 98– (2006)
[35] Lund RT, Tech. Rev. 87 pp 18– (1984)
[36] DOI: 10.1016/0377-2217(91)90130-N · Zbl 0734.90036
[37] Neuendorf K-P, Fundamenta Informaticae 47 pp 295– (2001)
[38] DOI: 10.1177/1063293X9800600407
[39] DOI: 10.1016/S0377-2217(99)00219-2 · Zbl 0951.91034
[40] DOI: 10.1016/S0925-5273(00)00142-0
[41] DOI: 10.1109/TEPM.2004.843128
[42] DOI: 10.1016/S0007-8506(07)61453-X
[43] DOI: 10.1109/TEPM.2003.817723
[44] DOI: 10.1080/095372897235316
[45] DOI: 10.1016/S0360-8352(97)00023-5
[46] Veerakamolmal P, Int. J. Flex. Autom. Integ. Manuf. 6 pp 245– (1998)
[47] DOI: 10.1287/opre.40.1.S145 · Zbl 0771.90031
[48] DOI: 10.1287/mnsc.5.1.89 · Zbl 0977.90500
[49] DOI: 10.1080/095372899232542
[50] DOI: 10.1002/nav.20089 · Zbl 1072.90011
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.