Abstract
This paper presents the basic structure for two disassembly scheduling algorithms applied to a single product structure. The first algorithm addresses the case when all items in the product are unique. The second algorithm accounts for common items.
Keywords
Disassembly, End of life products
Subject Categories
Recycling (Waste (etc.))
Disciplines
Engineering
Publisher
Omnipress
Publication Date
1995
Rights Information
Copyright 1995, Surendra M. Gupta
Rights Holder
Gupta M. Surendra
Permanent URL
Recommended Citation
Gupta, Surendra M. and Taleb, Karim N., "Algorithms for disassembly scheduling" (1995). . Paper 17. http://hdl.handle.net/2047/d10013969
COinS
Click button above to open, or right-click to save.
Notes
Originally published in the Proceedings of the 1995 Northeast Decision Sciences Institute Conference, Providence, Rhode Island, pp. 406-408, March 22-24, 1995