On solving the assembly line worker assignment and balancing problem via beam search

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 workers might even be incompatible with certain tasks. The ALWABP was introduced to model assembly lines typical for sheltered work centers for the Disabled. In this paper we introduce an algorithm based on beam search for solving the ALWABP with the objective of minimizing the cycle time when given a fixed number of work stations, respectively workers. The experimental results show that our algorithm is currently a state-of-the-art method for this version of the ALWABP. In comparison to results from the literature, our algorithm obtains better or equal results in all cases. Moreover, the algorithm is very robust for what concerns the application to problem instances of different characteristics.Postprint (published version

Profile and competences of Spanish industrial engineers in the European Higher Education Area (EHEA)

The aim of this document is to develop a clear definition of the role of the industrial engineer. This is important in the Spanish context, where the engineer curricula are evolved in a different way than in other countries, due to the role developed by the Professional Associations of Engineers and Technical Engineers. To this end we identify here the professional profiles to be expected of those graduating from such courses, the sectors where they are most likely to be recruited, and the context within which industrial engineers are employed. We deal with meanings and proposals for Industrial Engineers within a European context, drawing information from the academic debate which has been launched in a number of scientific publications. The text summarizes our personal reflections, which are integrated within a proposal for action intended as an additional contribution to the critical debate as to the situation, rather than a final responsePeer Reviewe

On solving the assembly line worker assignment and balancing problem via beam search

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 known 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 workers might even be incompatible with certain tasks. The ALWABP was introduced to model assembly lines typical for sheltered work centers for the Disabled. In this paper we introduce an algorithm based on beam search for solving the ALWABP with the objective of minimizing the cycle time when given a fixed number of work stations, respectively, workers. This problem version is denoted as ALWABP-2. The experimental results show that our algorithm is currently a state-of-the-art method for the ALWABP-2. In comparison to results from the literature, our algorithm obtains better or equal results in all cases. Moreover, the algorithm is very robust for what concerns the application to problem instances of different characteristicsBlum, C.; Miralles Insa, CJ. (2011). On solving the assembly line worker assignment and balancing problem via beam search. Computers and Operations Research. 38(1):328-339. doi:10.1016/j.cor.2010.05.008S32833938

On solving the assembly line worker assignment and balancing problem via beam search

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 workers might even be incompatible with certain tasks. The ALWABP was introduced to model assembly lines typical for sheltered work centers for the Disabled. In this paper we introduce an algorithm based on beam search for solving the ALWABP with the objective of minimizing the cycle time when given a fixed number of work stations, respectively workers. The experimental results show that our algorithm is currently a state-of-the-art method for this version of the ALWABP. In comparison to results from the literature, our algorithm obtains better or equal results in all cases. Moreover, the algorithm is very robust for what concerns the application to problem instances of different characteristics

On solving the assembly line worker assignment and balancing problem via beam search

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 workers might even be incompatible with certain tasks. The ALWABP was introduced to model assembly lines typical for sheltered work centers for the Disabled. In this paper we introduce an algorithm based on beam search for solving the ALWABP with the objective of minimizing the cycle time when given a fixed number of work stations, respectively workers. The experimental results show that our algorithm is currently a state-of-the-art method for this version of the ALWABP. In comparison to results from the literature, our algorithm obtains better or equal results in all cases. Moreover, the algorithm is very robust for what concerns the application to problem instances of different characteristics

Job rotation in assembly lines employing disabled workers

In this paper we consider the programming of job rotation in the assembly line worker assignment and balancing problem. The motivation for this study comes from the designing of assembly lines in sheltered work centers for the disabled, where workers have different task execution times. In this context, the well-known training aspects associated with job rotation are particularly desired. We propose a metric along with a mixed integer linear model and a heuristic decomposition method to solve this new job rotation problem. Computational results show the efficacy of the proposed heuristics. (C) 2009 Elsevier B.V. All rights reserved.Regional Valencian Government (Spain)[GVA 2007-241]Regional Valencian Government (Spain)CNPq Conselho Nacional de Desenvolvimento Cientifico e Tecnologico (Brazil)[561672/2008-3]Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq

Two extensions for the ALWABP: Parallel stations and collaborative approach

In this article, we introduce two new variants of the Assembly Line Worker Assignment and Balancing Problem (ALWABP) that allow parallelization of and collaboration between heterogeneous workers. These new approaches suppose an additional level of complexity in the Line Design and Assignment process, but also higher flexibility; which may be particularly useful in practical situations where the aim is to progressively integrate slow or limited workers in conventional assembly lines. We present linear models and heuristic procedures for these two new problems. Computational results show the efficiency of the proposed approaches and the efficacy of the studied layouts in different situations. (C) 2012 Elsevier B.V. All rights reserved