Sürdürülebilir Kalkınma Amaçları
Yazarlar
Yayınlar
- MakaleAçık Erişim2018Scopus SJRQ1An optimisation support for the design of hybrid production lines including assembly and disassembly tasks
Mete, Süleyman; Çil, Zeynel Abidin; Özceylan, Eren; Ağpak, Kürşad; Battaïa, Olga
The optimisation problems related to the assignment of tasks to workstations in assembly and disassembly lines have been largely discussed in the literature. They are known, respectively, as Assembly Line Balancing and Disassembly Line Balancing Problems. In this study, both types of task performed on the identical product are integrated in a common hybrid production system. Therefore, the logistic process is simplified and disassembly tasks can supply easier the assembly tasks with the required components. The considered production system has the layout of two parallel lines with common workstations. The product flow is conventional in the assembly line and reverse in the disassembly line. The paper provides a new mathematical model for designing such a hybrid system and an approximate approach based on ant colony optimisation for solving large-scale instances. The solution method is tested in a case study. The obtained results are compared with the solution provided by the design of two independent lines. The analysis of the results highlights the potential benefits of the hybrid production system.
AtıfScopus53OpenAlex51
İncele - MakaleYalnız künye2016Scopus SJRQ1A solution approach based on beam search algorithm for disassembly line balancing problem
Mete, Süleyman; Çil, Zeynel Abidin; Ağpak, Kürşad; Özceylan, Eren; Dolgui, Alexandre
The disassembly line balancing (DLB) problem is the process of allocating a set of disassembly tasks to an ordered sequence of workstations in such a way that optimizes some performance measures (e.g., cycle time, number of stations). Since DLB problems belong to the class of NP hard, many heuristic and meta-heuristic algorithms are applied to cope with the complexity of the DLB problems in order to obtain acceptable solutions in a reasonable amount of time. In this study, a beam search (BS) based approach for the DLB problem is proposed. Minimization of number of workstations is used as the performance measure. The proposed algorithm is compared with the optimal solutions of well-known real cases and generated test problems. The results indicate that the proposed approach based on BS is a very competitive and promising tool for further researches.
AtıfScopus70OpenAlex72İncele