Constraint programming approaches to disassembly line balancing problem with sequencing decisions

•A disassembly line balancing problem with sequencing decisions is considered.•The constraint programming model is able solve the problems with up to 35 tasks.•The proposed approach finds new best solutions for all large-sized instances.•The use of warm-start in the models makes the large-sized prob...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 126; s. 105111 - 20
Hlavní autor: Edis, Emrah B.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.02.2021
Pergamon Press Inc
Témata:
Algorithms
Balancing
Benchmarks
Combinatorial analysis
Constraint programming
Constraints
Disassembly line balancing
Dismantling
Heuristic methods
Integer programming
Linear programming
Mixed integer
Operations research
Recovery
Sequencing
Warm-start
Workstations
Disassembly line balancing
Sequencing
Constraint programming
Warm-start
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•A disassembly line balancing problem with sequencing decisions is considered.•The constraint programming model is able solve the problems with up to 35 tasks.•The proposed approach finds new best solutions for all large-sized instances.•The use of warm-start in the models makes the large-sized problems solvable. Recovery 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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2020.105111