Product cooperative disassembly sequence planning based on branch-and-bound algorithm

ISSN： 0268-3768

Source： The International Journal of Advanced Manufacturing Technology, Vol.51, Iss.9-12, 2010-12, pp. : 1139-1147

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Parallelised branch-and-bound algorithm for raster-based landfill siting

By Liu Kun-Hsing Kao Jehng-Jung

Civil Engineering and Environmental Systems, Vol. 30, Iss. 1, 2013-03 ,pp. : 15-25

Taylor & Francis Ltd

Access to resources Recommend Favorite

A hierarchical approach to disassembly sequence planning for mechanical product

By Dong Tianyang Zhang Ling Tong Ruofeng Dong Jinxiang

The International Journal of Advanced Manufacturing Technology, Vol. 30, Iss. 5-6, 2006-09 ,pp. : 507-520

Springer Publishing Company

Access to resources Recommend Favorite

Empirical stochastic branch-and-bound for optimization via simulation

By Xu Wendy Lu Nelson Barry L.

IIE Transactions, Vol. 45, Iss. 7, 2013-07 ,pp. : 685-698

Taylor & Francis Ltd

Access to resources Recommend Favorite

Microrobot based micro-assembly sequence planning with hybrid ant colony algorithm

By Shuang Bing Chen Jiapin Li Zhenbo

The International Journal of Advanced Manufacturing Technology, Vol. 38, Iss. 11-12, 2008-10 ,pp. : 1227-1235

Springer Publishing Company

Access to resources Recommend Favorite

Parallel RRT-based path planning for selective disassembly planning

By Aguinaga Iker Borro Diego Matey Luis

The International Journal of Advanced Manufacturing Technology, Vol. 36, Iss. 11-12, 2008-04 ,pp. : 1221-1233

Springer Publishing Company

Access to resources Recommend Favorite