1,814 research outputs found

    Time and space multi-manned assembly line balancing problem using genetic algorithm

    Get PDF
    Purpose: Time and Space assembly line balancing problem (TSALBP) is the problem of balancing the line taking the area required by the task and to store the tools into consideration. This area is important to be considered to minimize unplanned traveling distance by the workers and consequently unplanned time waste. Although TSALBP is a realistic problem that express the real-life situation, and it became more practical to consider multi-manned assembly line to get better space utilization, few literatures addressed the problem of time and space in simple assembly line and only one in multi-manned assembly line. In this paper the problem of balancing bi-objective time and space multi-manned assembly line is proposed Design/methodology/approach: Hybrid genetic algorithm under time and space constraints besides assembly line conventional constraints is used to model this problem. The initial population is generated based on conventional assembly line heuristic added to random generations. The objective of this model is to minimize number of workers and number of stations. Findings: The results showed the effectiveness of the proposed model in solving multi-manned time and space assembly line problem. The proposed method gets better results in solving real-life Nissan problem compared to the literature. It is also found that there is a relationship between the variability of task time, maximum task time and cycle time on the solution of the problem. In some problem features it is more appropriate to solve the problem as simple assembly line than multi-manned assembly line. Originality/value: It is the first article to solve the problem of balancing multi-manned assembly line under time and area constraint using genetic algorithm. A relationship between the problem features and the solution is found according to it, the solution method (one sided or multi-manned) is definedPeer Reviewe

    Ant colony optimization for the single model U-type assembly line balancing problem

    Get PDF
    Cataloged from PDF version of article.An assembly line is a production line in which units move continuously through a sequence of stations. The assembly line balancing problem is defined as the allocation of tasks to an ordered sequence of stations subject to precedence constraints with the objective of optimizing a performance measure. In this paper, we propose ant colony algorithms to solve the single-model U-type assembly line balancing problem. We conduct an extensive experimental study in which the performance of the proposed algorithm is compared against best known algorithms reported in the literature. The results indicate that the proposed algorithms display very competitive performance against them. & 2009 Elsevier B.V. All rights reserved

    Ant Colony Optimization For Multiobjective Buffers Sizing Problems

    Get PDF
    International audienc

    Mixed-model parallel two-sided assembly line balancing problem: A flexible agent-based ant colony optimization approach

    Get PDF
    This is the author accepted manuscript. The final version is available from the publisher via the DOI in this record.Assembly lines are frequently used as a production method to assemble complex products. Two-sided assembly lines are utilized to assemble large-sized products (e.g., cars, buses, trucks). Locating two lines in parallel helps improve line efficiency by enabling collaboration between the line workers. This paper proposes a mixed-model parallel two-sided assembly line system that can be utilized to produce large-sized items in an inter-mixed sequence. The mixed-model parallel two-sided line balancing problem is defined and the advantages of utilizing multi-line stations across the lines are discussed. A flexible agent-based ant colony optimization algorithm is developed to solve the problem and a numerical example is given to explain the method systematically. The proposed algorithm builds flexible balancing solutions suitable for any model sequence launched. The dynamically changing workloads of workstations (based on specific product models during the production process) are also explored. A comprehensive experimental study is conducted and the results are statistically analyzed using the well-known paired sample t-test. The test results indicate that the mixed-model parallel two-sided assembly line system reduces the workforce need in comparison with separately balanced mixed-model two-sided lines. It is also shown that the proposed algorithm outperforms the tabu search algorithm and six heuristics often used in the assembly line balancing domain

    Research Trends and Outlooks in Assembly Line Balancing Problems

    Get PDF
    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

    New matrix methodology for algorithmic transparency in assembly line balancing using a genetic algorithm

    Get PDF
    © 2022. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/This article focuses on the Mixed-Model Assembly Line Balancing single-target problem of type 2 with single-sided linear assembly line configurations, which is common in the industrial environment of small and medium-sized enterprises (SMEs). The main objective is to achieve Algorithmic Transparency (AT) when using Genetic Algorithms for the resolution of balancing operation times. This is done by means of a new matrix methodology that requires working with product functionalities instead of product references. The achieved AT makes it easier for process engineers to interpret the obtained solutions using Genetic Algorithms and the factors that influence decisions made by algorithms, thereby helping in the later decision-making process. Additionally, through the proposed new matrix methodology, the computational cost is reduced with respect to the stand-alone use of Genetic Algorithms. The AT produced using the new matrix methodology is validated through its application in an industry-based paradigmatic example.Peer ReviewedPostprint (published version
    • …
    corecore