✦ LIBER ✦

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

✍ Scribed by Ozcan Kilincci; G. Mirac Bayhan

Publisher: Springer
Year: 2007
Tongue: English
Weight: 197 KB
Volume: 37
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-007-0975-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 Petri net-based heuristic for simple a

A Petri net-based heuristic for simple assembly line balancing problem of type 2

✍ Ozcan Kilincci 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 163 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

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 multiobjective genetic algo

An efficient multiobjective genetic algorithm for mixed-model assembly line balancing problem considering demand ratio-based cycle time

✍ Wenqiang Zhang; Mitsuo Gen 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 693 KB

Multi-rule Multi-objective Simulated Ann

Multi-rule Multi-objective Simulated Annealing Algorithm for Straight and U Type Assembly Line Balancing Problems

✍ Adil Baykasoglu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 292 KB