10,399 research outputs found
The Car Resequencing Problem with Pull-Off Tables
The car sequencing problem determines sequences of different car models launched down a mixed-model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated.mixed-model assembly line, car sequencing, resequencing
Free and regular mixed-model sequences by a linear program-assisted hybrid algorithm GRASP-LP
A linear program-assisted hybrid algorithm (GRASP-LP) is presented to solve a mixed-model sequencing problem in an assembly line. The issue of the problem is to obtain manufacturing sequences of product models with the minimum work overload, allowing the free interruption of operations at workstations and preserving the production mix. The implemented GRASP-LP is compared with other procedures through a case study linked with the Nissan’ Engine Plant from Barcelona.Peer ReviewedPostprint (author's final draft
An exact algorithm for the mixed-model level scheduling problem
The Monden Problem, also known as the Output Rate Variation Problem, is one of the original formulations for mixed-model assembly line-level scheduling problems in a just-in-time system. In this paper, we develop a new branch-and-bound procedure for the problem that uses several new and previously proposed lower and upper bounds. The algorithm also includes several dominance rules that leverage the symmetry in the problem as well as a new labelling procedure that avoids repeated exploration of previously examined partial solutions. The branching strategy exploits the capabilities of current multiprocessor computers by exploring the search tree in a parallel fashion. The algorithm has been tested on several sets of instances from the literature and is able to optimally solve problems that are double the size of those addressed by other procedures previously reported in the literature.Preprin
Simple heuristics for the assembly line worker assignment and balancing problem
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.Comment: 18 pages, 1 figur
Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
Cataloged from PDF version of article.Beam search (BS) is used as a heuristic to solve various combinatorial optimization problems, ranging from scheduling
to assembly line balancing. In this paper, we develop a backtracking and an exchange-of-information (EOI) procedure to
enhance the traditional beam search method. The backtracking enables us to return to previous solution states in the
search process with the expectation of obtaining better solutions. The EOI is used to transfer information accumulated
in a beam to other beams to yield improved solutions.
We developed six different versions of enhanced beam algorithms to solve the mixed-model assembly line scheduling
problem. The results of computational experiments indicate that the backtracking and EOI procedures that utilize problem
specific information generally improve the solution quality of BS.
2007 Elsevier B.V. All rights reserved
Overview on: sequencing in mixed model flowshop production line with static and dynamic context
In the present work a literature overview was given on solution techniques considering basic as well as more advanced and consequently more complex arrangements of mixed model flowshops. We first analyzed the occurrence of setup time/cost; existing solution techniques are mainly focused on permutation sequences. Thereafter we discussed objectives resulting in the introduction of variety of methods allowing resequencing of jobs within the line. The possibility of resequencing within the line ranges from 1) offline or intermittent buffers, 2) parallel stations, namely flexible, hybrid or compound flowshops, 3) merging and splitting of parallel lines, 4) re-entrant flowshops, to 5) change job attributes without physically interchanging the position.
In continuation the differences in the consideration of static and dynamic demand was studied. Also intermittent setups are possible, depending on the horizon and including the possibility of resequencing, four problem cases were highlighted: static, semi dynamic, nearly dynamic and dynamic case.
Finally a general overview was given on existing solution methods, including exact and approximation methods. The approximation methods are furthermore divided in two cases, know as heuristics and methaheuristic
Research Trends and Outlooks in Assembly Line Balancing Problems
This paper presents the findings from the survey of articles published on the assembly line balancing problems (ALBPs) during 2014-2018. Before proceeding a comprehensive literature review, the ineffectiveness of the previous ALBP classification structures is discussed and a new classification scheme based on the layout configurations of assembly lines is subsequently proposed. The research trend in each layout of assembly lines is highlighted through the graphical presentations. The challenges in the ALBPs are also pinpointed as a technical guideline for future research works
Assembly Line
An assembly line is a manufacturing process in which parts are added to a product in a sequential manner using optimally planned logistics to create a finished product in the fastest possible way. It is a flow-oriented production system where the productive units performing the operations, referred to as stations, are aligned in a serial manner. The present edited book is a collection of 12 chapters written by experts and well-known professionals of the field. The volume is organized in three parts according to the last research works in assembly line subject. The first part of the book is devoted to the assembly line balancing problem. It includes chapters dealing with different problems of ALBP. In the second part of the book some optimization problems in assembly line structure are considered. In many situations there are several contradictory goals that have to be satisfied simultaneously. The third part of the book deals with testing problems in assembly line. This section gives an overview on new trends, techniques and methodologies for testing the quality of a product at the end of the assembling line
Recommended from our members
Pleiotropic and Epistatic Network-Based Discovery: Integrated Networks for Target Gene Discovery
Biological organisms are complex systems that are composed of functional networks of interacting molecules and macro-molecules. Complex phenotypes are the result of orchestrated, hierarchical, heterogeneous collections of expressed genomic variants. However, the effects of these variants are the result of historic selective pressure and current environmental and epigenetic signals, and, as such, their co-occurrence can be seen as genome-wide correlations in a number of different manners. Biomass recalcitrance (i.e., the resistance of plants to degradation or deconstruction, which ultimately enables access to a plant’s sugars) is a complex polygenic phenotype of high importance to biofuels initiatives. This study makes use of data derived from the re-sequenced genomes from over 800 different Populus trichocarpa genotypes in combination with metabolomic and pyMBMS data across this population, as well as co-expression and co-methylation networks in order to better understand the molecular interactions involved in recalcitrance, and identify target genes involved in lignin biosynthesis/degradation. A Lines Of Evidence (LOE) scoring system is developed to integrate the information in the different layers and quantify the number of lines of evidence linking genes to target functions. This new scoring system was applied to quantify the lines of evidence linking genes to lignin-related genes and phenotypes across the network layers, and allowed for the generation of new hypotheses surrounding potential new candidate genes involved in lignin biosynthesis in P. trichocarpa, including various AGAMOUS-LIKE genes. The resulting Genome Wide Association Study networks, integrated with Single Nucleotide Polymorphism (SNP) correlation, co-methylation, and co-expression networks through the LOE scores are proving to be a powerful approach to determine the pleiotropic and epistatic relationships underlying cellular functions and, as such, the molecular basis for complex phenotypes, such as recalcitrance
- …