✦ LIBER ✦

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

✍ Scribed by Ilana Berger; Jean-Marie Bourjolly; Gilbert Laporte

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 513 KB
Volume: 58
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(92)90208-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound algorithm for the mul

A branch-and-bound algorithm for the multi-level uncapacitated facility location problem

✍ Dong-wan Tcha; Bum-il Lee 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 518 KB

Two branch and bound algorithms for the

Two branch and bound algorithms for the permutation flow shop problem

✍ Jacques Carlier; Ismaïl Rebaï 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 957 KB

A heuristic network procedure for the as

A heuristic network procedure for the assembly line balancing problem

✍ Peter A. Pinto; David G. Dannenbring; Basheer M. Khumawala 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 417 KB

## Abstract Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally y

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

A branch and bound algorithm for the acy

A branch and bound algorithm for the acyclic subgraph problem

✍ R. Kaas 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 612 KB

Solving Multi-objective MILP Problems in

Solving Multi-objective MILP Problems in Process Synthesis using the Multi-Criteria Branch and Bound Algorithm

✍ G. Mavrotas; D. Diakoulaki 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 1 views