Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks (original) (raw)
Related papers
Heuristic procedures for solving the general assembly line balancing problem with setups
International Journal of Production Research, 2010
The General Assembly Line Balancing Problem with Setups (GALBPS) was recently defined in the literature. It adds sequence-dependent setup time considerations to the classical Simple Assembly Line Balancing Problem (SALBP) as follows: whenever a task is assigned next to another at the same workstation, a setup time must be added to compute the global workstation time, thereby providing the task sequence inside each workstation. This paper proposes over 50 priority-rule-based heuristic procedures to solve GALBPS, many of which are an improvement upon heuristic procedures published to date.
A Hybrid Grasp-genetic Algorithm for Mixed-model Assembly Line Balancing Problem Type 2
International Journal of Computing
In manufacturing systems, mixed model assembly lines are used to produce different products to deal with the problem of customers’ demands variety, and minimizing the cycle time in such assembly line is a critical problem. This paper addresses the mixed model assembly line balancing problem type 2 that consists in finding the optimal cycle time for a given number of workstations. A hybrid Greedy randomized adaptive search procedure-Genetic algorithm is proposed to find the optimal assignment of tasks among workstations that minimize the cycle. A Ranked Positional Weight heuristic is used in the construction phase of the proposed GRASP, and in the local search phase, a neighborhood search procedure is used to ameliorate the constructed solutions in the construction phase. The GRASP is executed many times in order to seed the initial population of the proposed genetic algorithm, and the results of the executions are compared with the final solutions obtained by the hybrid GRASP-GA. I...
Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem
Hybrid Metaheuristics, 2009
The Assembly Line Worker Assignment and Balancing Problem (ALWABP) appears in real assembly lines which we have to assign given tasks to workers where there are some task-worker incompatibilities and considering that the operation time for each task is different depending upon who executes the task. This problem is typical for Sheltered Work Centers for the Disabled and it is well known to be NP-Hard. In this paper, the hybrid method Clustering Search (CS) is implemented to solve the ALWABP. The CS identifies promising regions of the search space by generating solutions with a metaheuristic, such as Iterated Local Search, and clustering them into clusters that are then explored further with local search heuristics. Computational results considering instances available in the literature are presented to demonstrate the efficacy of the CS.
Simple heuristics for the assembly line worker assignment and balancing problem
Journal of Heuristics, 2012
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 rules defining the order in which the tasks and workers should be assigned to the workstations. We present a number of such rules and compare their performance across three possible uses: as a stand-alone method, as an initial solution generator for meta-heuristics, and as a decoder for a hybrid genetic algorithm. Our results show that the heuristics are fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.
Comparative Analysis of Different Heuristics for Cost Oriented Assembly Line Balancing Problems
Abstract— Assembly line balancing problem consists of a finite set of tasks, where each of them has a duration time and precedence relations, which specify the acceptable ordering of the tasks. Line balancing is an attempt to locate tasks to each workstation on the assembly line. The basic ALB problem is to assign a set of tasks to an ordered set of workstations, so that the precedence relationships were satisfied, and performance factors were optimized. This paper shows the comparison of different heuristics for cost oriented assembly line balancing problem which has been taken from literature. Comparison is done on the basis of their smoothness index, cost and line efficiency. The computational results show that the proposed heuristic performs better and minimizes the production cost.
A Hybrid Genetic Algorithm for Assembly Line Balancing
Journal of Heuristics, 2002
This paper presents a hybrid genetic algorithm for the simple assembly line problem, SALBP-1. The chromosome representation of the problem is based on random keys. The assignment of the operations to the workstations is based on a heuristic priority rule in which the priorities of the operations are defined by the chromosomes. A local search is used to improve the solution. The approach is tested on a set of problems taken from the literature and compared with other approaches. The computation results validate the effectiveness of the algorithm.
This paper addresses the Simple Assembly Line Balancing Problem of type II (SALBP-II), with simultaneous e ects of deterioration and learning in which there are sequence-independent setup times relating to each task. In many real industrial environments, although the actual task processing times are de ned as a function of their starting times due to deterioration e ects, workstations improve continuously as a result of repeating the same activities by worker(s) or machine(s). In this paper, a mathematical model is developed for this novel problem, attempting to minimize the cycle time for a given number of workstations. In addition to the balancing of the assembly line, the developed model presents the execution scheduling of tasks assigned to each workstation. Moreover, a hybrid meta-heuristic method is proposed to solve such an NP-hard problem. This robust and simply structured solution approach uses the tabu search within the Variable Neighbourhood Search (VNS/TS). The computational experiments and comparison with a Di erential Evolution Algorithm (DEA) re ect the high e ciency of our proposed algorithm for a number of well-known instances.
An enumerative heuristic and reduction methods for the assembly line balancing problem
European Journal of Operational Research, 2003
A new heuristic algorithm and new reduction techniques for the type 1 assembly line balancing problem are presented. The new heuristic is based on the well-known Hoffmann heuristic and builds solutions from both sides of the precedence network to choose the best. The reduction techniques aim at augmenting precedences, conjoining tasks and increasing operation times. The heuristic is tested on its own and also in combination with the reduction techniques. The tests, which are carried out on a well-known benchmark set of problem ...
… Centre for Soft …, 2008
In this work we present two new multi-objective proposals based on Ant Colony Optimisation and randomised greedy algorithms to solve a more realistic extension of a classical industrial problem: Time and Space Assembly Line Balancing. Some variants of them have been compared in order to find out the impact of different configurations and the use of the heuristic information. Good performance is shown after applying every algorithm to ten well-known problem instances in comparison to NSGA-II. In addition, those algorithms which have provided the best results have been employed to tackle a real-world instance from an automotive industry plant of Nissan, located in Spain.