✦ LIBER ✦

Fast, Effective Algorithms for Simple Assembly Line Balancing Problems

✍ Scribed by Steven T. Hackman, Michael J. Magazine and T. S. Wee

Book ID: 123687523
Publisher: INFORMS
Year: 1989
Tongue: English
Weight: 390 KB
Volume: 37
Category: Article
ISSN: 0030-364X
DOI: 10.2307/171473

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

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

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

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 competitive branch-and-bound algorithm

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

✍ Sprecher, A. 📂 Article 📅 1999 🏛 Taylor and Francis Group 🌐 English ⚖ 634 KB