Özcan, Uğur2020-03-262020-03-262010Özcan, U., (2010). Balancing Stochastic Two-Sided Assembly Lines: A Chance-Constrained, Piecewise-Linear, Mixed Integer Program and a Simulated Annealing Algorithm. European Journal of Operational Research, 205(1), 81-97. Doi: 10.1016/j.ejor.2009.11.0330377-22171872-6860https://dx.doi.org/10.1016/j.ejor.2009.11.033https://hdl.handle.net/20.500.12395/24650Two-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.en10.1016/j.ejor.2009.11.033info:eu-repo/semantics/openAccessFacilities planning and designLine balancingTwo-sided assembly linesInteger programmingSimulated annealingArticle20518197Q1WOS:000275363700008Q1