Please use this identifier to cite or link to this item:
|Title:||Branch-and-bound algorithms for simple assembly line balancing problem||Authors:||Liu, S.B.
|Keywords:||Assembly line balancing
|Issue Date:||Feb-2008||Citation:||Liu, S.B., Ng, K.M., Ong, H.L. (2008-02). Branch-and-bound algorithms for simple assembly line balancing problem. International Journal of Advanced Manufacturing Technology 36 (1-2) : 169-177. ScholarBank@NUS Repository. https://doi.org/10.1007/s00170-006-0821-y||Abstract:||In this paper, exact algorithms for solving the simple assembly line balancing type I problem are presented. The proposed algorithms consist of a constructive and two destructive algorithms. Several well-known lower-bound computational methods are also applied in these algorithms. Computational experiments were carried out to test the performance of the proposed algorithms based on a set of benchmark problem instances. The computational results show that the algorithms proposed in this paper are efficient in solving the simple assembly line balancing benchmark problem instances. Moreover, a problem instance whose optimal solution had previously been unknown is solved by one of the proposed algorithms. © 2006 Springer-Verlag London Limited.||Source Title:||International Journal of Advanced Manufacturing Technology||URI:||http://scholarbank.nus.edu.sg/handle/10635/63045||ISSN:||02683768||DOI:||10.1007/s00170-006-0821-y|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 24, 2020
WEB OF SCIENCETM
checked on Jan 17, 2020
checked on Jan 27, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.