𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A shortest route formulation of simple U-type assembly line balancing problem

✍ Scribed by Hadi Gökçen; Kürşat Ağpak; Cevriye Gencer; Emel Kizilkaya

Book ID
108056801
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
138 KB
Volume
29
Category
Article
ISSN
0307-904X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest-route formulation of mixed-mode
Shortest-route formulation of mixed-model assembly line balancing problem
✍ Erdal Erel; Hadi Gokcen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 279 KB

A shortest-route formulation of the mixed-model assembly line balancing problem is presented. Common tasks across models are assumed to exist and these tasks are performed in the same stations. The formulation is based on an algorithm which solves the single-model version of the problem. The mixed-m

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