Product disassembly sequence planning based on constraint satisfaction problems

Zhongguo Jixie Gongcheng/China Mechanical Engineering

Volumn 21, Issue 17, 2010, Pages 2058-2062

  Song, Shouxu ^a   Hu, Di ^a   Gao, Yang ^a   Yang, Ming ^a   Zhang, Lei ^a  

^a HEFEI UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Backtracking; Constraint satisfaction problem; Disassembly constraint graph; Disassembly sequence planning; Hybrid graph

Indexed keywords

EID: 77957786513     PISSN: 1004132X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. Zussman E, Zhou M C. A Methodology for Modeling and Adaptive Planning of Disassembly Processes[J]. IEEE Transactions on Robotics and Automation, 1999, 15(1): 190-194.
2. 2006, 37(7): 138-141.
3. 2007, 19(3): 387-391, 397.
4. 2007, 19(6): 742-747.
5. Wang Hui, Xiang Dong, Duan Guanghong. A Genetic Algorithm for Product Disassembly Sequence Planning[J]. Neurocomputing, 2008, 71: 13-15.
6. 2009, 20(6): 699-703.
7. 2009, 15(3): 508-514.
8. Minton S, Johnston M D, Laird P. Minimal Conflicts: a Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems[J]. Artificial Intelligence, 1992, 58(1/3): 161-206.
9. Selman B, Kautz H. Domain-independent Extensions to GSAT: Solving Large Structured Satisfiability Problems[C]//Proc. IJCAI-93. Charnbery, France, 1993: 290-295.
10. Glover F, Laguna M. Tabu Search. Modern Heuristics for Combinatorial Problems[M]. Oxford, Blackwell Scientific Publishing, 1993.
11. Jing Rong Li, Li Pheng Khoo, Shu Beng Tor. Generation of Possible Multiple Components Disassembly Sequence for Maintenance Using a Disassembly Constraint Graph[J]. International Journal of Production Economics, 2006, 102(1): 51-65.
12. 2007, 3: 24-29.
13. 2008, 27(7): 955-962.
14. Tsang E. Foundations of Constraint Satisfaction[M]. London: Academic Press, 1993.
15. 2007, 44(12): 2078-2084.