Shortest route formulation of mixed-model assembly line balancing problem
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/10935
European Journal of Operational Research
- Department of Management 
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. Ó 1999 Elsevier Science B.V. All rights reserved.
Erel, E., & Gokcen, H. (1999). Shortest-route formulation of mixed-model assembly line balancing problem. European Journal of Operational Research, 116(1), 194-204.