دانلود کتاب The Disassembly Line: Balancing and Modeling

فهرست مطالب :

Contents......Page 9
Preface......Page 17
Acknowledgments......Page 21
Part I: Disassembly Background......Page 25
1.1 Overview......Page 27
1.2 Motivation......Page 29
1.3 Scope and Objectives......Page 30
1.4 Format and Notation......Page 31
1.5 Outline......Page 40
2.2 Production Background......Page 43
2.3 History of the Assembly Line......Page 46
2.4 Assembly-Line Balancing......Page 47
2.5 Line Modeling......Page 48
2.6 Summary......Page 55
3.2 Overview......Page 57
3.3 History of the Disassembly Line......Page 61
3.4 Disassembly-Specific Considerations......Page 62
4.2 Environmentally Conscious Manufacturing and Product Recovery......Page 71
4.3 Assembly-Line Balancing and Manufacturing Systems......Page 73
4.4 Disassembly and Remanufacturing......Page 76
4.5 Optimization and Algorithms......Page 83
5.2 General Product Disassembly Representations......Page 85
5.4 Disassembly Constraint Graphs......Page 92
5.5 Schematic/Flowchart-Style Vertex and Arc Disassembly Representation......Page 94
5.6 Other Representations......Page 98
6.1 Introduction......Page 101
6.2 Complexity Theory Background......Page 102
6.3 NP-Completeness......Page 106
6.4 NP-Completeness in the Strong Sense......Page 109
6.5 NP-Hardness......Page 110
6.6 Overview of NP-Complete Problems......Page 111
6.7 Solving NP-Complete Problems......Page 112
6.8 Other Classes of Problems......Page 113
6.9 Heuristic Performance Analysis......Page 114
6.10 Hardware and Software Considerations......Page 115
Part II: Disassembly-Line Balancing......Page 117
7.2 The Disassembly-Line Balancing Problem......Page 119
7.3 Model Considerations......Page 120
7.4 Balancing Objectives......Page 123
8.1 Introduction......Page 125
8.2 Problem Overview......Page 126
8.3 Balance Measure and Theoretical Bounds Formulation......Page 127
8.4 Hazard Measure and Theoretical Bounds Formulation......Page 129
8.5 Demand Measure and Theoretical Bounds Formulation......Page 130
8.6 Direction Measure and Theoretical Bounds Formulation......Page 131
8.7 Models and Measures as Prototypes......Page 132
8.8 Matrices for Precedence Representation......Page 133
9.2 DLBP NP-Completeness......Page 135
9.3 DLBP NP-Completeness in the Strong Sense......Page 137
9.4 DLBP NP-Hardness......Page 138
10.1 Introduction......Page 141
10.2 Combinatorial Optimization Methodologies......Page 142
10.3 Exhaustive Search......Page 145
10.5 Ant Colony Optimization......Page 146
10.6 Greedy Algorithm......Page 147
10.8 k-Opt Heuristic......Page 148
10.9 H-K General-Purpose Heuristic......Page 149
11.1 Introduction......Page 157
11.2 Personal Computer Instance......Page 158
11.3 The 10-Part Instance......Page 160
11.4 Cellular Telephone Instance......Page 161
11.5 DLBP A Priori Optimal Solution Benchmark Instances......Page 164
12.2 Graphical Analysis Tools......Page 173
12.3 Multiple-Criteria Decision-Making Considerations......Page 175
12.4 Normalization and Efficacy Index Equations......Page 178
12.5 Simulation......Page 180
13.2 Model Description......Page 183
13.3 Numerical Results......Page 185
13.4 Conclusions......Page 188
14.2 Model Description......Page 189
14.3 DLBP-Specific Genetic Algorithm Architecture......Page 190
14.4 DLBP-Specific Qualitative Modifications......Page 191
14.5 DLBP-Specific Quantitative Modifications......Page 192
14.6 Numerical Results......Page 194
14.7 Conclusions......Page 204
15.2 Model Description......Page 205
15.3 DLBP-Specific Qualitative Modifications and the Metaheuristic......Page 206
15.5 Numerical Results......Page 211
15.6 Conclusions......Page 221
16.2 Model Description......Page 223
16.3 Numerical Results......Page 227
16.4 Conclusions......Page 235
17.1 Introduction......Page 237
17.2 Model Description......Page 238
17.3 Numerical Results......Page 241
17.4 Conclusions......Page 250
18.1 Introduction......Page 251
18.2 Model Description......Page 252
18.3 Numerical Results......Page 256
18.4 Conclusions......Page 265
19.2 DLBP Application......Page 267
19.3 DLBP A Priori Numerical Analysis for Varying Skip Size......Page 268
19.4 Numerical Results......Page 276
19.5 Conclusions......Page 285
20.1 Introduction......Page 287
20.2 Experimental Results......Page 288
20.3 Conclusions......Page 296
21.2 Problem Extensions......Page 299
21.3 Additional Solution Methodologies......Page 300
21.4 Probabilistic Disassembly-Line Balancing......Page 301
21.6 Future Research Directions......Page 302
Part III: Further Disassembly-Line Considerations......Page 305
22.1 Introduction......Page 307
22.2 Mathematical Models......Page 308
22.3 Computational Complexity......Page 309
22.4 Case Studies......Page 310
22.5 Analytical and Solution Methodologies......Page 311
23.2 Sustainable Product Design Overview......Page 313
23.3 New-Product Design Metrics for Demanufacturing......Page 314
23.4 Additional Design-for-Disassembly Studies......Page 317
23.5 Summary......Page 318
24.2 Background......Page 319
24.3 Facility Location and Layout Overview......Page 324
24.4 Mixed-Model Disassembly-Line Design......Page 327
24.5 Disassembly-Line Design Metrics......Page 328
25.2 Machine Sequencing and Scheduling Overview......Page 331
25.3 Disassembly Sequencing and Scheduling......Page 332
25.4 Stochastic Sequencing and Scheduling......Page 337
25.5 Additional Disassembly-Sequencing Studies......Page 338
25.6 Additional Disassembly-Scheduling Studies......Page 339
26.2 Inventory Theory Background......Page 341
26.3 Disassembly to Order......Page 342
26.4 Additional Disassembly-Inventory Studies......Page 347
27.2 Just-in-Time Background......Page 349
27.3 Just-in-Time Research......Page 351
27.4 Multikanban System for End-of-Life Products......Page 352
28.2 Disassembly-Line Revenue Background......Page 361
28.3 Disassembly-Line Revenue Modeling......Page 362
28.4 Additional Disassembly-Line Revenue Studies......Page 365
29.2 Background......Page 367
29.4 Queueing Theory Background......Page 368
29.5 Benchmark Data for Measuring Unbalance......Page 372
References......Page 373
Appendix: Acronyms......Page 387
D......Page 389
K......Page 390
R......Page 391
Z......Page 392
C......Page 393
H......Page 394
P......Page 395
S......Page 396
Y......Page 397