✦ LIBER ✦

A branch-and-bound algorithm for two-sided assembly line balancing

✍ Scribed by Er-Fei Wu; Ye Jin; Jin-Song Bao; Xiao-Feng Hu

Publisher: Springer
Year: 2007
Tongue: English
Weight: 182 KB
Volume: 39
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-007-1286-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search algorithm for two-sided as

A tabu search algorithm for two-sided assembly line balancing

✍ Uğur Özcan; Bilal Toklu 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 206 KB

Branch-and-bound algorithms for simple a

Branch-and-bound algorithms for simple assembly line balancing problem

✍ S. B. Liu; K. M. Ng; H. L. Ong 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 179 KB

Branch-and-bound algorithms for the mult

Branch-and-bound algorithms for the multi-product assembly line balancing problem

✍ Ilana Berger; Jean-Marie Bourjolly; Gilbert Laporte 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 513 KB

A branch and bound algorithm for the two

A branch and bound algorithm for the two-stage assembly scheduling problem

✍ A.M.A. Hariri; C.N. Potts 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 654 KB

A two-process implicit enumeration algor

A two-process implicit enumeration algorithm for the simple assembly line balancing problem

✍ Matthew J. Saltzman; Ilker Baybars 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 893 KB

An efficient load balancing strategy for

An efficient load balancing strategy for grid-based branch and bound algorithm

✍ M. Mezmaz; N. Melab; E.-G. Talbi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 286 KB

The most popular parallelization approach of the branch and bound algorithm consists in building and exploring in parallel the search tree representing the problem being tackled. The deployment of such parallel model on a grid rises the crucial issue of dynamic load balancing. The major question is