A genetic algorithm based approach for simultaneously balancing and sequencing of mixed-model U-lines with parallel workstations and zoning constraints

Hamzadayı A., YILDIZ G.

COMPUTERS & INDUSTRIAL ENGINEERING, cilt.62, sa.1, ss.206-215, 2012 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 62 Sayı: 1
  • Basım Tarihi: 2012
  • Doi Numarası: 10.1016/j.cie.2011.09.008
  • Dergi Adı: COMPUTERS & INDUSTRIAL ENGINEERING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.206-215
  • Anahtar Kelimeler: Mixed-model U-shape balancing/sequencing problem, Genetic algorithm, Simulated annealing algorithm, Fitness evaluation-relaxation, Parallel workstation assignment, Zoning constraint, ASSEMBLY LINES, OPTIMIZATION, FORMULATION
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

This paper presents a Priority-Based Genetic Algorithm (PGA) based method for the simultaneously tackling of the mixed-model U-shape assembly line (MMUL) line balancing/model sequencing problems (MMUL/BS) with parallel workstations and zoning constraints and allows the decision maker to control the process to create parallel workstations and to work in different scenarios. In the presented method, simulated annealing based fitness evaluation approach (SABFEA) is developed to be able to make fitness function calculations easily and effectively. A new fitness function is adapted to MMULs for aiming at minimizing the number of workstations as primary goal and smoothing the workload between-within workstations by taking all cycles into consideration. A numerical example to clarify the solution methodology is presented. Performance of the proposed approach is tested through sets of test problem with randomly generated minimum part sets. The results of the computational experiments indicate that SABFEA works with PGA very concordantly; and it is an effective method in solving MMUL/BS with parallel workstations and zoning constraints. (C) 2011 Elsevier Ltd. All rights reserved.