Shortest-route formulation of mixed-model assembly line balancing problem
Date
1999
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
European Journal of Operational Research
Print ISSN
0377-2217
Electronic ISSN
Publisher
Elsevier
Volume
116
Issue
1
Pages
194 - 204
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
Abstract
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 single-model system with a combined precedence diagram. The model is capable of considering any constraint that can be expressed as a function of task assignments.