MATHEMATICAL PROBLEMS IN ENGINEERING, cilt.2016, 2016 (SCI-Expanded)
In a multi-manned assembly line, tasks of the same workpiece can be executed simultaneously by different workers working in the same station. This line has significant advantages over a simple assembly line such as shorter line length, less work-in-process, smaller installation space, and less product flow time. In many realistic line balancing situations, there are usually more than one objective conflicting with each other. This paper presents a preemptive goal programming model and some heuristic methods based on variable neighborhood search approach for multi-objective assembly line balancing problems with multi-manned stations. Three different objectives are considered, minimizing the total number of multi-manned stations as the primary objective, minimizing the total number of workers as the secondary objective, and smoothing the number of workers at stations as the tertiary objective. A set of test instances taken from the literature is solved to compare the performance of all methods, and results are presented.