We present a new mathematical model for the assembly line balancing problem with the objective of maximizing the line comfort to operators. Besides minimizing discrepancies between the ergonomic risks of workstations, balancing is subject to temporal and spatial conditions for the workstations. To evaluate the performance of the proposed model, we compare it with other mathematical model whose ...

Robotic assembly line balancing (RALB) is specific for robotic assembly, where different robots require different assembly times to perform the same task because of their specialization. The problem includes optimal assignment of robots to line stations and balanced distribution of work between different stations. It aims at maximizing the production rate of the line. This problem is solved by ...

Certain types of manufacturing processes can be modelled by assembly line balancing problems. In this work we deal with a specific assembly line balancing problem that is know as the assembly line worker assignment and balancing problem (ALWABP). This problem appears in settings where tasks must be assigned to workers, and workers to work stations. Task processing times are worker specific, and...

In this paper, we present an extension to the TSALB problem (Time and Space constrained Assembly Line Balancing) with ergonomic risk restrictions. This ergonomic risk is defined from the task durations and their categories regarding to the risk factor for the workers. A study is presented through a case linked to an engine assembly line in the Automobile industry, considering variable demand.

We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the classical simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority ...

In this paper, we propose a mathematical optimisation model to solve the simple assembly line rebalancing problem. This problem arises when an existing assembly line has to be rebalanced in order to meet new production requirements. In this paper, a Mixed Integer Program is proposed for solving this problem with the objective to minimize the number of changes in the initial line. The computatio...

The goal of this work is to develop an improved procedure for the solution of the lexicographic bottleneck variant of the assembly line balancing problem (LB-ALBP). The objective of the LB-ALBP is to minimize the workload of the most heavily loaded workstation, followed by the workload of the second most heavily loaded workstation and so on. This problem —recently introduced to the literature (...

A shortest-route formulation of the mixed-model assembly line balancing problem is presented. Common tasks across models are assumed to exist and these tasks are performed in the same stations. The formulation is based on an algorithm which solves the single-model version of the problem. The mixed-model system is transformed into a singlemodel system with a combined precedence diagram. The mode...