The Disassembly Line: Balancing and Modeling

個数:

The Disassembly Line: Balancing and Modeling

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Hardcover:ハードカバー版/ページ数 398 p.
  • 言語 ENG
  • 商品コード 9780071622875
  • DDC分類 658.5

Full Description

Publisher's Note: Products purchased from Third Party sellers are not guaranteed by the publisher for quality, authenticity, or access to any online entitlements included with the product.
The definitive guide to the disassembly lineThe 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.

Contents

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

最近チェックした商品