The definitive guide to the disassembly line
The Disassembly Line: Balancing and Modeling provides in-depth information on this complex process essential to remanufacturing, recycling, and environmentally conscious manufacturing. This pioneering work offers efficient techniques required to solve problems involving the number of workstations required and the disassembly sequencing of end-of-life products on the disassembly line.
In this book, the disassembly line balancing problem (DLBP) is described, defined mathematically, and illustrated by case studies. Combinatorial optimization methodologies are presented as solutions to the DLBP.
Coverage includes:
-
Graphical representations of products to be disassembled
-
Computational complexity of combinatorial problems
-
Description of the disassembly line and the mathematical model
-
Computational complexity of the DLBP
-
Combinatorial optimization searches
-
Experimental instances
-
Analytical methodologies
-
Exhaustive search
-
Genetic algorithm
-
Ant colony optimization
-
Greedy algorithm
-
Greedy/adjacent element hill climbing hybrid
-
Greedy/2-opt hybrid
-
H-K heuristic
-
Quantitative and qualitative comparative analysis
This authoritative volume also covers product planning, line and facility design, sequencing and scheduling, inventory, just in time, revenue, and unbalanced lines.
Preface
Acknowledgments
Part I : Disassembly Background
Chapter 1 : Introduction
Chapter 2 : Assembly Lines
Chapter 3 : Disassembly Lines
Chapter 4 : Related Research
Chapter 5 : Graphical Representations of Products to be Disassembled
Chapter 6 : Computational Complexity of Combinatorial Problems
Part II : Disassembly-Line Balancing
Chapter 7 : Disassembly-Line Balancing Overview
Chapter 8 : Description of the Disassembly Line and the Mathematical Model
Chapter 9 : Computational Complexity of DLBP
Chapter 10 : Combinatorial Optimization Searches
Chapter 11 : Experimental Instances
Chapter 12 : Analytical Methodologies
Chapter 13 : Exhaustive Search
Chapter 14 : Genetic Algorithm
Chapter 15 : Ant Colony Optimization
Chapter 16 : Greedy Algorithm
Chapter 17 : Greedy/Adjacent Element Hill-Climbing Hybrid
Chapter 18 : Greedy/2-Opt Hybrid
Chapter 19 : H-K Heuristic
Chapter 20 : Quantitative and Qualitative Comparative Analysis
Chapter 21 : Other Disassembly-Line Balancing Research
Part III : Further Disassembly-Line Considerations
Chapter 22 : Overview of Additional Disassembly-Line Related Problems
Chapter 23 : Disassembly-Line Product Planning
Chapter 24 : Disassembly-Line Design
Chapter 25 : Disassembly-Line Sequencing and Scheduling
Chapter 26 : Disassembly-Line Inventory
Chapter 27 : Disassembly-Line Just-in-Time
Chapter 28 : Disassembly-Line Revenue
Chapter 29 : Unbalanced Disassembly Lines
References
Appendix : Acronyms
Author Index
Subject Index
