Sürdürülebilir Kalkınma Amaçları

  • MakaleAçık Erişim2020Scopus SJRQ2
    A mathematical model and tabu search algorithm for multi-manned assembly line balancing problems with assignment restrictions

    Yilmaz, Hamid; Yilmaz, Mustafa

    A multi-manned assembly line is a set of workstations where task operations can be performed on multiple sides of the line. Such assembly lines are important for large products, such as buses, cars and trucks. In this study, a mathematical model for multi-manned assembly lines with assignment restrictions is proposed. The purpose of the mathematical model is to minimize the total number of workers and open multi-manned workstations along the line for a given cycle time simultaneously under various assignment restrictions. The model provides a more realistic situation for multi-manned assembly line problems. The tabu search algorithm (TSA) is also used to solve the problem. The performances of both methods on well-known data-set problems are analysed. Based on the computational experiments, the performance of the proposed TSA is compared with the mathematical model solutions on various problem instances. The experimental results verify the effectiveness and efficiency of the proposed TSA.

    • SDG 9 · Sanayi, Yenilikçilik ve Altyapı
    AtıfScopus33WoS28OpenAlex33
    ScopusWeb of Scienceİncele
  • BildiriYalnız künye2017
    Multi-manned assembly line balancing problem: Resource constrained case

    Yilmaz, Hamid; Yilmaz, Mustafa

    In this paper, a new approach on multi-manned assembly line balancing problem is presented. The goal of proposed approach is to establish balance of multi-manned assembly line with minimum number of worker, workstation and resources. For this purpose, mathematical model is developed for the problem. Finally, this model is solved for a numerical example using Gurobi to indicate the applicability of the proposed mathematical model.

    AtıfScopus1
    Scopusİncele