Balancing assembly lines with tabu search
نویسندگان
چکیده
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to solve large scale problems, softwares implementing simple heuristics are still the most commonly used tools in industry. Some metaheuristics have also been proposed and shown to improve on classical heuristics but, to our knowledge, no computational experiments have been performed on real industrial applications to clearly assess their performance as well as their flexibility. Here we present a new tabu search algorithm and discuss its differences with respect to those in the literature. We then evaluate its performance on the Type I assembly line balancing problem. Finally, we test our algorithm on a real industrial data set involving 162 tasks, 264 precedence constraints, and where the assembly is carried out on a sequential line with workstations located on both sides of the conveyor, with two possible conveyor heights and no re-positioning of the product. We discuss the flexibility of the metaheuristic and its ability to solve real industrial cases. 2004 Elsevier B.V. All rights reserved.
منابع مشابه
A Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...
متن کاملBalancing parallel assembly lines with disabled workers
In this paper we study an assembly line balancing problem that occurs in sheltered worker centers for the disabled, where workers with very different characteristics are present. We are interested in the situation in which complete parallel assembly lines are allowed and name the resulting problem as parallel assembly line worker assignment and balancing problem (PALWABP). This approach enables...
متن کاملA Hybrid Tabu Search Method for Assembly Line Balancing
A new hybrid tabu search (HTS) method for solving assembly line balancing problems is proposed in this paper. The tabu search (TS) method is combined with the genetic algorithm (GA) to identify and provide solutions for assembly line balancing problems. With the proposed HTS method, the TS method can well address the number of tasks assigned for each workstation, while the GA can also assign th...
متن کاملTabu Search With Target Analysis To The Assembly Line Balancing Problems -- An Artificial Intelligence Approach
This paper describes the application of tabu search, a recent heuristic technique for combinatorial optimization problems, to the assembly line balancing problems. Computational experiments with different search strategies have been performed for some assembly ine problems from literature. Computational results show that except for few cases tabu search always finds optimal solutions.
متن کاملMetaheuristic Approach to Assembly Line Balancing
In this paper, the metaheuristic method consisting of the adaptive tabu search (ATS) and the practicing heuristic (PH) technique is proposed to provide optimal solutions of the assembly line balancing (ALB) problems. With the multi-objective approach, the ATS is used to address the number of tasks assigned for each workstation, while the PH is conducted to assign the sequence of tasks for each ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 168 شماره
صفحات -
تاریخ انتشار 2006