Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/8289
Title: | Simulated annealing algorithm for solving sequence-dependent disassembly line balancing problem | Authors: | Kalaycı, Can Berk Gupta, S.M. |
Keywords: | Disassembly Metaheuristics Product recovery Sequence-dependent disassembly line balancing Simulated annealing Constraint satisfaction problems Manufacture Disassembly line balancing Meta heuristics Multiple-objectives Precedence constraints Sequence-dependent Simulated annealing algorithms |
Publisher: | IFAC Secretariat | Abstract: | In this paper, we consider a sequence-dependent disassembly line balancing problem (SDDLBP) with multiple objectives that concerns with the assignment of disassembly tasks to a set of ordered disassembly workstations while satisfying the disassembly precedence constraints and optimizing the effectiveness of several measures considering sequence-dependent time increments among disassembly tasks. Due to the high complexity of the SDDLBP, there is currently no known way to optimally solve even moderately sized instances of the problem; therefore an efficient methodology based on the simulated annealing is proposed to solve the SDDLBP. © IFAC. | URI: | https://hdl.handle.net/11499/8289 https://doi.org/10.3182/20130619-3-RU-3018.00064 |
ISBN: | 14746670 (ISSN) 9783902823359 |
Appears in Collections: | Mühendislik Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection |
Files in This Item:
File | Size | Format | |
---|---|---|---|
10.3182 20130619-3-RU-3018.00064.pdf | 1.66 MB | Adobe PDF | View/Open |
CORE Recommender
SCOPUSTM
Citations
37
checked on Mar 8, 2025
Page view(s)
36
checked on Feb 8, 2025
Download(s)
66
checked on Feb 8, 2025
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.