Constraint programming approaches to disassembly line balancing problem with sequencing decisions

Simple item page
dc.contributor.authorEdis E.B.
dc.date.accessioned2024-07-22T08:06:09Z
dc.date.available2024-07-22T08:06:09Z
dc.date.issued2021
dc.description.abstractRecovery of products has received much attention in the last decade due to the increase in both environmental awareness and regulations enacted by governments. In product recovery, disassembly of a product into its constituent parts on a line is one of the most significant operations. This paper deals with a disassembly line balancing and sequencing (DLBS) problem subject to balancing issues, hazardousness of parts, demand quantities and direction changes considered in a lexicographic order. Due to the combinatorial nature of this problem, exact methods, e.g., mixed integer linear programming (MILP), are able to solve only small and medium size problems. Therefore, various metaheuristic algorithms are proposed in literature to find near-optimal solutions. In this paper, constraint programming (CP), which is a suitable technique especially for highly-constrained discrete problems, is used to develop models and solution approaches. To the best of author's knowledge, this study is the first that uses CP for the disassembly line balancing problems. For the DLBS problem, first, a generic CP model is developed. This CP model provides efficient results for small/medium size disassembly problems and benchmark instances. Observing that the generic CP model could not produce even feasible sequence of tasks for some large-sized benchmark instances, a CP-based solution approach is proposed. This approach generates a feasible sequence subject to a fixed assignment of tasks to the workstations by using a CP model and uses this sequence as an initial feasible solution within a warm-start context in CP sequencing models. The computational results show that the proposed CP model improves the several best solutions of medium-sized benchmark instances, while the proposed CP-based solution approach produces excellent results in all large test instances by either improving the best solutions (found so far) or establishing new benchmark solutions. © 2020 Elsevier Ltd
dc.identifier.DOI-ID10.1016/j.cor.2020.105111
dc.identifier.issn03050548
dc.identifier.urihttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/13388
dc.language.isoEnglish
dc.publisherElsevier Ltd
dc.subjectBenchmarking
dc.subjectComputer programming
dc.subjectConstraint theory
dc.subjectEnvironmental regulations
dc.subjectComputational results
dc.subjectConstraint programming
dc.subjectDisassembly line balancing
dc.subjectEnvironmental awareness
dc.subjectLexicographic order
dc.subjectMeta heuristic algorithm
dc.subjectMixed-integer linear programming
dc.subjectNear-optimal solutions
dc.subjectInteger programming
dc.titleConstraint programming approaches to disassembly line balancing problem with sequencing decisions
dc.typeArticle

Files

Collections

Scopus Koleksiyonu