✦ LIBER ✦

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

✍ Scribed by S. B. Liu; K. M. Ng; H. L. Ong

Publisher: Springer
Year: 2006
Tongue: English
Weight: 179 KB
Volume: 36
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-006-0821-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 two-sid

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

✍ Er-Fei Wu; Ye Jin; Jin-Song Bao; Xiao-Feng Hu 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 182 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

Firing sequences backward algorithm for

Firing sequences backward algorithm for simple assembly line balancing problem of type 1

✍ Ozcan Kilincci 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 417 KB

## a b s t r a c t The objective of simple assembly line balancing problem type-1 (SALBP-1) is to minimize the number of workstations on an assembly line for a given cycle time. Since SALBP-1 is NP-hard, many iterative backtracking heuristics based on branch and bound procedure, tabu search, and g

AP-invariant-based algorithm for simple

AP-invariant-based algorithm for simple assembly line balancing problem of type-1

✍ Ozcan Kilincci; G. Mirac Bayhan 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 197 KB

A Petri net approach for simple assembly

A Petri net approach for simple assembly line balancing problems

✍ Ozcan Kilincci; G. Mirac Bayhan 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 158 KB