Heuristics for demand-driven disassembly planning
type: Item
instance of: scholarly article
title: Heuristics for demand-driven disassembly planning
zbMATH Open document ID: 1109.90012
author: Ian M. Langella
published in: Computers \& Operations Research
publication date: 2006-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5072740
zbMATH Keywords: disassembly planning
zbMATH Keywords: reverse logistics
zbMATH Keywords: demand-driven disassembly
zbMATH Keywords: heuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2005.03.013
OpenAlex ID: W2032414275
cites work: Optimization analysis for recycle-oriented manufacturing systems
cites work: Scheduling disassembly
cites work: Disassembly scheduling with parts commonality using Petri nets with timestamps.
cites work: Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships
cites work: Disassembly sequencing: A survey
DOI: 10.1016/J.COR.2005.03.013
description: scientific article; zbMATH DE number 5072740