✦ LIBER ✦

Shortest-route formulation of mixed-model assembly line balancing problem

✍ Scribed by Erdal Erel; Hadi Gokcen

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 279 KB
Volume: 116
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(98)00115-5

No coin nor oath required. For personal study only.

✦ Synopsis

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-model system is transformed into a singlemodel system with a combined precedence diagram. The model is capable of considering any constraint that can be expressed as a function of task assignments.

📜 SIMILAR VOLUMES

On “Currently Practiced Formulations of

On “Currently Practiced Formulations of the Assembly Line Balance Problem”

✍ Ilker Baybars 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 536 KB

A balancing problem for mixed model asse

A balancing problem for mixed model assembly lines with a paced moving conveyor

✍ Xiaobo Zhao; Katsuhisa Ohno; Hon-Shiang Lau 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the