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 ...

Although the simple assembly line balancing problem (SALBP) is the topic of many studies, typically they either consider minimizing the number of stations for a given cycle time (called type one), or minimizing the cycle time for a given number of stations (called type two). Rarely, type E of the problem has been considered. In the type E, cycle time and number of stations are both decision var...

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...

This paper presents an approach, based on ant techniques, to effectively address the assembly line balancing problem with the complicating factors of parallel workstations, stochastic task durations, and mixed-models. A methodology was inspired by the behavior of social insects in an attempt to distribute tasks among workers so that strategic performance measures are optimized. This methodology...

Many real life problems contain imprecise variables, constraints and objectives. Fuzzy set theory gives an opportunity to handle imprecise terms in such situations. Two-sided assembly line balancing (2sALB) problem which is a generalization of the well known simple assembly line balancing problem can also be modeled more realistically by employing fuzzy approaches. Such an approach is presented...

SALBP is an NP-hard problem. There are some measures proposed to grasp the difficulty of SALBP. Order Strength, Flexibility Ratio and West Ratio all of which are based on SALBP precedence networks are among them. This study investigates the sensitivity of difficulty of SALBP type 2 to the three measures. A SALBP solver is created in Python programming language. Computational experiments are con...

Assembly line balancing problem (ALBP) is a decision problem arising when designing or redesigning an assembly line and it consists in finding the optimal assignment of tasks among the workstations corresponding to some objectives. This paper deals with the single-model ALBP with the aim of minimizing the cycle time and maximizing the workload smoothness among the workstations. In order to solv...