Shortest-route formulation of mixed-model assembly line balancing problem
Date
1999
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
1
views
views
10
downloads
downloads
Citation Stats
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.
Source Title
European Journal of Operational Research
Publisher
Elsevier
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Collections
Language
English