Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm

Ozcan U.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.205, sa.1, ss.81-97, 2010 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 205 Sayı: 1
  • Basım Tarihi: 2010
  • Doi Numarası: 10.1016/j.ejor.2009.11.033
  • Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.81-97
  • Anahtar Kelimeler: Facilities planning and design, Line balancing, Two-sided assembly lines, Integer programming, Simulated annealing, GENETIC ALGORITHM, HEURISTIC METHOD, MODEL, OPTIMIZATION, SINGLE, TOOL
  • Gazi Üniversitesi Adresli: Hayır

Özet

Two-sided assembly lines are often designed to produce large-sized products, such as automobiles, trucks and buses. In this type of a production line, both left-side and right-side of the line are used in parallel. In all studies oil two-sided assembly lines, the task times are assumed to be deterministic. However, in real life applications, especially in manual assembly lines, the tasks may have varying execution times defined as a probability distribution. The task time variation may result from machine breakdowns, loss of motivation, lack of training, non-qualified operators, complex tasks, environment, etc. In this paper. the problem of balancing two-sided assembly lines with stochastic task times (STAL-BP) is considered. A chance-constrained, piecewise-linear, mixed integer program (CPMIP) is proposed to model and solve the problem. As a solution approach a Simulated annealing (SA) algorithm is proposed. To assess the effectiveness of CPMIP and SA algorithm, a set of test problems are solved. Finally, computational results indicating the effectiveness of CPMIP and SA algorithm are reported. (C) 2009 Elsevier B.V. All rights reserved.