Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs

Disassembling complex products is formally approached via network representation and subsequent mathematical modeling, aimed at selecting a good or optimum sequence of disassembly operations. This is done via heuristics, metaheuristics or mathematical programming. In contrast with heuristics and met...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Omega (Oxford) Jg. 34; H. 6; S. 538 - 549
1. Verfasser:	Lambert, A.J.D.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Elsevier Ltd 01.12.2006 Elsevier Pergamon Press Inc
Schriftenreihe:	Omega
Schlagworte:	Assembly planning Assembly planning Disassembly planning Mathematical programming Network Traveling salesperson problem Optimization Disassembly planning Linear programming Mathematical models Mathematical programming Network Network flow problem Optimization Studies Traveling salesman problem Traveling salesperson problem Disassembly planning Traveling salesperson problem Optimization Assembly planning Network Mathematical programming
ISSN:	0305-0483, 1873-5274
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!