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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Omega (Oxford) Ročník 34; číslo 6; s. 538 - 549
Hlavný autor:	Lambert, A.J.D.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Elsevier Ltd 01.12.2006 Elsevier Pergamon Press Inc
Edícia:	Omega
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!