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

Creative Commons License

Erel E., Gokcen H.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.116, ss.194-204, 1999 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 116
  • Basım Tarihi: 1999
  • Doi Numarası: 10.1016/s0377-2217(98)00115-5
  • Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.194-204
  • Anahtar Kelimeler: assignment, assembly line balancing, network programming, ALGORITHMS
  • Gazi Üniversitesi Adresli: Evet

Özet

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. (C) 1999 Elsevier Science B.V. All rights reserved.