Disassembly sequence plan generation using a branch-and-bound algorithm

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.39, Iss.3, 2001-02, pp. : 481-509

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

Abstract

Related content

Optimal disassembly sequence generation using a genetic programming

By Shimizu Yoshiaki Tsuji Kyohei Nomura Masayuki

International Journal of Production Research, Vol. 45, Iss. 18-19, 2007-09 ,pp. : 4537-4554

Taylor & Francis Ltd

Access to resources Recommend Favorite

A competitive branch-and-bound algorithm for the simple assembly line balancing problem

By Sprecher A.

International Journal of Production Research, Vol. 37, Iss. 8, 1999-05 ,pp. : 1787-1816

Taylor & Francis Ltd

Access to resources Recommend Favorite

A bilinear programming model and a modified branch-and-bound algorithm for production planning in steel rolling mills with substitutable demand

By As'ad Rami Demirli Kudret

International Journal of Production Research, Vol. 49, Iss. 12, 2011-06 ,pp. : 3731-3749

Taylor & Francis Ltd

Access to resources Recommend Favorite

An improved best-first branch-and-bound algorithm for constrained two-dimensional guillotine cutting problems

By Yoon K. Ahn S. Kang M.

International Journal of Production Research, Vol. 51, Iss. 6, 2013-03 ,pp. : 1680-1693

Taylor & Francis Ltd

Access to resources Recommend Favorite

An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems

By Kang M. Yoon K.

International Journal of Production Research, Vol. 49, Iss. 15, 2011-08 ,pp. : 4437-4455

Taylor & Francis Ltd

Access to resources Recommend Favorite