책 이미지
책 정보
· 분류 : 외국도서 > 기술공학 > 기술공학 > 제조
· ISBN : 9781574443349
· 쪽수 : 448쪽
· 출판일 : 2004-12-28
목차
DISASSEMBLY PRACTICEIntroductionAssembly and Disassembly HistoryLevels of AggregationDisassembly OptimizationBasic TerminologyProduct ModelingSummary of the ChaptersReferencesContext of the End-Of-Life DisassemblyIntroductionIndustrial EcologyComplex ProductsComplex Products WasteBreakdown Analyses of Some Prominent Complex ProductsConclusionReferencesThe Disassembly ProcessIntroductionThe ProductThe ProcessCost MetricsRevenue MetricsEconomic OptimizationEconomic-Ecological (Eco-Eco) ModelsExample: Disassembly of Discarded CarsConclusionReferencesDISASSEMBLY SEQUENCINGDisassembly Network FeaturesIntroductionDisassembly Process RepresentationUnconstrained ProductsTopologically Constrained ProductsWeakly Connected ProductsGeometrically Constrained ProductsConclusionAppendicesReferencesGeometrical Constraints and Precedence RelationshipsIntroductionEarlier Research on Precedence RelationshipsBourjault's MethodThe Cut-Set MethodA Moderately Complex Examplem-Disassemblable ProductsComplex AND/OR RelationshipsThree-Dimensional ApplicationsDisassembly Precedence GraphsConstrained Connection DiagramsConclusionReferencesSurface- and Direction-Oriented Analysis, and ModularityIntroductionProduct Representation and ClassesSurface-Oriented AnalysisDirection-Oriented ApproachInterference GraphsModularity AnalysisStability AnalysisForce-Flow AnalysisConclusionReferencesSelecting the Optimum Disassembly SequenceIntroductionSequence Independent CostsSequence Dependent Costs, Heuristics, and Restricted Exact MethodsRigorous Exact MethodsDemand-Dependent ProblemsConclusionReferencesDISASSEMBLY PLANNINGDisassembly to Order Problems: Multi-Criteria MethodsIntroductionMulti-Criteria MethodologiesGoal ProgrammingLinear Physical ProgrammingConclusionReferencesDisassembly Line Balancing ProblemsIntroductionAn Assembly Line Versus a Disassembly LineBalancing a Disassembly LineDescription of the Disassembly Line Balancing ProblemHeuristic and Metaheuristic Methods For Solving the DLBPConclusionReferences














