Linked e-resources
Details
Table of Contents
Intro
Preface
Acknowledgements
Contents
Abbreviations
List of Figures
List of Tables
1 Introduction to Remanufacturing
1.1 The Need for Remanufacturing
1.2 Concept and Main Activities of Remanufacturing
1.3 Optimisation Problems in Remanufacturing
1.4 Summary
References
2 Robotic Disassembly for Remanufacturing
2.1 Concept and General Process of Robotic Disassembly
2.1.1 Is Robotic Disassembly New?
2.1.2 How Robotic Disassembly Works
2.1.3 How Are Disassembly Operations Defined?
2.1.4 How Robotic Disassembly Operations are Carried Out
2.1.5 What is Disassembly Planning and Scheduling?
2.2 Characteristics of Robotic Disassembly
2.2.1 How Disassembly is Different to Assembly
2.2.2 How to Adapt Assembly to Disassembly
2.3 Design of a Disassembly Cell Using Techniques For Assembly Cell Design
2.4 Key Enablers of Robotic Disassembly
2.4.1 Phase 1-Enabling Manufacturers to Benefit from Robotic Disassembly: Robust Disassembly
2.4.2 Phase 2-Enabling Third-Party Remanufacturers to Benefit from Robotic Disassembly: Flexible Disassembly
2.4.3 Phase 3-A Possible Goal of Robotic Disassembly: Autonomous Disassembly
2.5 Summary
References
3 Product Representation for Disassembly Sequence Planning
3.1 Classification of Product Representations
3.2 Matrix Representation
3.2.1 Interference Matrix
3.2.2 Disassembly Precedence Matrix
3.2.3 Immediate Preceded Matrix
3.3 Graph Representation
3.3.1 Task Precedence Diagram
3.3.2 Joint Precedence Graph
3.3.3 AND/OR Graph
3.3.4 Transformed AND/OR Graph
3.3.5 Connector-Based Precedence Graph
3.3.6 Disassembly Constraint Graph
3.4 Hybrid Representation
3.4.1 Component-Fastener Graph
3.4.2 Disassembly Graph Model and Disassembly Sequence Structure Graph
3.4.3 Disassembly Hybrid Graph Model
3.4.4 Disassembly Petri Net
3.5 Transformation and Comparison Between Different Representations
3.6 Summary
References
4 Component and Subassembly Detection
4.1 Overview
4.2 Two-Pointer Detection Strategy
4.3 Performance Analysis of the Two-Pointer Strategy
4.4 Summary
References
5 Modelling of Robotic Disassembly Sequence Planning
5.1 Preliminaries
5.2 Mathematical Representation
5.2.1 Decision Variables
5.2.2 Objectives
5.2.3 Constraints
5.3 Uncertainties in Robotic Disassembly
5.4 Summary
References
6 Modelling of Robotic Disassembly Line Balancing
6.1 Problem Statement
6.2 Mathematical Representation
6.2.1 Notations and Decision Variables
6.2.2 Objectives
6.2.3 Constraints
6.3 Representation of Uncertain Task Time in DLBP
6.4 Model Extendibility to Different Environments
6.5 Summary
References
7 Evolutionary Optimisation for Robotic Disassembly Sequence Planning and Line Balancing
7.1 Basic Process of Evolutionary Optimisation
7.2 Typical Evolutionary Algorithms
7.2.1 Typical Single-Objective Evolutionary Algorithm.
Preface
Acknowledgements
Contents
Abbreviations
List of Figures
List of Tables
1 Introduction to Remanufacturing
1.1 The Need for Remanufacturing
1.2 Concept and Main Activities of Remanufacturing
1.3 Optimisation Problems in Remanufacturing
1.4 Summary
References
2 Robotic Disassembly for Remanufacturing
2.1 Concept and General Process of Robotic Disassembly
2.1.1 Is Robotic Disassembly New?
2.1.2 How Robotic Disassembly Works
2.1.3 How Are Disassembly Operations Defined?
2.1.4 How Robotic Disassembly Operations are Carried Out
2.1.5 What is Disassembly Planning and Scheduling?
2.2 Characteristics of Robotic Disassembly
2.2.1 How Disassembly is Different to Assembly
2.2.2 How to Adapt Assembly to Disassembly
2.3 Design of a Disassembly Cell Using Techniques For Assembly Cell Design
2.4 Key Enablers of Robotic Disassembly
2.4.1 Phase 1-Enabling Manufacturers to Benefit from Robotic Disassembly: Robust Disassembly
2.4.2 Phase 2-Enabling Third-Party Remanufacturers to Benefit from Robotic Disassembly: Flexible Disassembly
2.4.3 Phase 3-A Possible Goal of Robotic Disassembly: Autonomous Disassembly
2.5 Summary
References
3 Product Representation for Disassembly Sequence Planning
3.1 Classification of Product Representations
3.2 Matrix Representation
3.2.1 Interference Matrix
3.2.2 Disassembly Precedence Matrix
3.2.3 Immediate Preceded Matrix
3.3 Graph Representation
3.3.1 Task Precedence Diagram
3.3.2 Joint Precedence Graph
3.3.3 AND/OR Graph
3.3.4 Transformed AND/OR Graph
3.3.5 Connector-Based Precedence Graph
3.3.6 Disassembly Constraint Graph
3.4 Hybrid Representation
3.4.1 Component-Fastener Graph
3.4.2 Disassembly Graph Model and Disassembly Sequence Structure Graph
3.4.3 Disassembly Hybrid Graph Model
3.4.4 Disassembly Petri Net
3.5 Transformation and Comparison Between Different Representations
3.6 Summary
References
4 Component and Subassembly Detection
4.1 Overview
4.2 Two-Pointer Detection Strategy
4.3 Performance Analysis of the Two-Pointer Strategy
4.4 Summary
References
5 Modelling of Robotic Disassembly Sequence Planning
5.1 Preliminaries
5.2 Mathematical Representation
5.2.1 Decision Variables
5.2.2 Objectives
5.2.3 Constraints
5.3 Uncertainties in Robotic Disassembly
5.4 Summary
References
6 Modelling of Robotic Disassembly Line Balancing
6.1 Problem Statement
6.2 Mathematical Representation
6.2.1 Notations and Decision Variables
6.2.2 Objectives
6.2.3 Constraints
6.3 Representation of Uncertain Task Time in DLBP
6.4 Model Extendibility to Different Environments
6.5 Summary
References
7 Evolutionary Optimisation for Robotic Disassembly Sequence Planning and Line Balancing
7.1 Basic Process of Evolutionary Optimisation
7.2 Typical Evolutionary Algorithms
7.2.1 Typical Single-Objective Evolutionary Algorithm.