This paper presents an empirical investigation for line balancing in aluminum industry. Assembly line problems (ALB) are divided into three types, single-model assembly lines to handle (easy) problems to build a product that is designed to build one kind of product, multiple and mixed model to design for different kinds of products. This paper is an effort to describe comprehensively the solution to the problem for single-model assembly lines using some practical software package named FLB. The primary objective of aluminum assembly line balancing is optimal deployment activities subject to various limitations. The preliminary results of this paper indicate that the implementation of line balancing could reduce make span, significantly.
One of the primary issues in line balancing problems is the uncertainty associated with the processing times. There are different reasons for having uncertain processing times such as task deterioration, failure in machines, etc. On the other hand, there are different objectives, such as cycle time, number of workstations in an assembly line balancing. In this paper, we present a multi-objective decision making assembly line balancing which minimizes different objectives such as cycle time and number of workstations. The resulted problem is formulated based on Lp-norm mixed integer programming and a meta-heuristic approach is also presented to solve the resulted model. The problem formulation is solved for some test examples and the results are discussed under different conditions.
This paper introduces the effect of task deterioration in simple assembly line balancing problem. In many realistic assembly lines, a deterioration task is considered when a task is started earlier than the assigned time since the station time is constant and the earliness of the task does not reduce the cycle time. This phenomenon is known as deteriorating tasks. Therefore, we seek an optimal assignment and schedule of tasks in workstations, in order to minimize the number of stations for a given cycle time, which is known as SALBP-1. For this purpose, a mathematical model is proposed. Since the pure SALBP-1 is proved to be NP-hard and considering task deterioration complicates problem further, we propose a genetic algorithm for solving such problem. Several well-known test problems are solved to study the performance of the proposed approach.