2008 IEEE International Conference on Service Operations and Logistics, and Informatics 2008
DOI: 10.1109/soli.2008.4682907
|View full text |Cite
|
Sign up to set email alerts
|

A genetic algorithm for disassembly scheduling with assembly product structure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…To solve this problem, they proposed a heuristic procedure that modifies the algorithm proposed by (Taleb and Gupta 1997) in order to alleviate the potential of infeasible solutions. (Gao and Chen 2008) proposed a genetic algorithm to solve the disassembly planning problem with a multi-level structure and one type product. The objective function is to minimize the sum of setup, inventory holding and disassembly operation costs.…”
Section: Deterministic and Incapacitated Modelsmentioning
confidence: 99%
“…To solve this problem, they proposed a heuristic procedure that modifies the algorithm proposed by (Taleb and Gupta 1997) in order to alleviate the potential of infeasible solutions. (Gao and Chen 2008) proposed a genetic algorithm to solve the disassembly planning problem with a multi-level structure and one type product. The objective function is to minimize the sum of setup, inventory holding and disassembly operation costs.…”
Section: Deterministic and Incapacitated Modelsmentioning
confidence: 99%