Sürdürülebilir Kalkınma Amaçları
Bu dergideki yayınlar
2 →- MakaleYalnız künye2020Scopus SJRQ1A fast branch, bound and remember algorithm for disassembly line balancing problem
Li, Zixiang; Çil, Zeynel Abidin; Mete, Suleyman; Kucukkoc, Ibrahim
In recent years, the interests of disassembly line have increased owing to economic reasons and the increase of environmental awareness. Effective line can provide many advantages in terms of economic aspect and it facilitates competition the companies with others. This study contributes to the relevant literature by a branch, bound and remember algorithm for disassembly line balancing problem with AND/OR precedence. The proposed exact solution method employs the memory-based dominance rule to eliminate the reduplicated sub-problems by storing all the searched sub-problems and to utilise cyclic best-first search strategy to obtain high-quality complete solutions fast. In this paper, minimising the number of stations is taken as the performance measure. The proposed methodology is tested on a set of 260 instances and compared with the mathematical model using CPLEX solver and five well-known metaheuristics. Computational results show that the proposed method is capable of obtaining the optimal solutions for all the tested instances with less than 0.1 seconds on average. Additionally, comparative study demonstrates that the proposed method is the state-of-the-art algorithm and outperforms the CPLEX solver and metaheuristics in terms of both solution quality and search speed aspects.
AtıfWoS66OpenAlex65İncele
- 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
Tam Kayıt
| Alan | Değer | Dil |
|---|---|---|
| creativeworkseries.issn | 0020-7543 | |
| dc.date.accessioned | 2026-10-28T14:56:54.489538874Z | |
| dc.date.available | 2026-10-28T14:56:54.489538874Z | |
| dc.identifier.uri | https://rdlopen.rawdatalibrary.net/r/munzur/3646 | |
| dc.publisher | Taylor and Francis Ltd. | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.title | International Journal of Production Research |

