| Preface | p. xv |
| Robotic Cells In Practice | p. 1 |
| Cellular Manufacturing | p. 2 |
| Robotic Cell Flowshops | p. 3 |
| Throughput Optimization | p. 7 |
| Historical Overview | p. 9 |
| Applications | p. 11 |
| A Classification Scheme For Robotic Cells And Notation | p. 15 |
| Machine Environment | p. 15 |
| Number of Machines | p. 15 |
| Number of Robots | p. 16 |
| Types of Robots | p. 17 |
| Cell Layout | p. 17 |
| Processing Characteristics | p. 17 |
| Pickup Criterion | p. 17 |
| Travel-Time Metric | p. 18 |
| Number of Part-Types | p. 20 |
| Objective Function | p. 20 |
| An ß/ Classification for Robotic Cells | p. 20 |
| Cell Data | p. 24 |
| Processing Times | p. 24 |
| Loading and Unloading Times | p. 24 |
| Notations for Cell States and Robot Actions | p. 25 |
| Cyclic Production | p. 29 |
| Operating Policies and Dominance of Cyclic Solutions | p. 29 |
| Cycle Times | p. 34 |
| Waiting Times | p. 34 |
| Computation of Cycle Times | p. 35 |
| Lower Bounds on Cycle Times | p. 39 |
| Optimal 1-Unit Cycles | p. 40 |
| Special Cases | p. 40 |
| General Cases: Constant Travel-Time Cells | p. 43 |
| Optimization over Basic Cycles | p. 51 |
| General Cases: Additive and Euclidean Travel-Time Cells | p. 61 |
| Calculation of Makespan of a Lot | p. 63 |
| A Graphical Approach | p. 63 |
| Algebraic Approaches | p. 64 |
| Quality of 1-Unit Cycles and Approximation Results | p. 65 |
| Additive Travel-Time Cells | p. 66 |
| Pyramidal Cycles | p. 68 |
| A 1.5-Approximation Algorithm | p. 68 |
| A 10/7-Approximation for Additive Cells | p. 74 |
| Constant Travel-Time Cells | p. 87 |
| A 1.5-Approximation Algorithm | p. 89 |
| Euclidean Travel-Time Cells | p. 94 |
| Dual-Gripper Robots | p. 101 |
| Additional Notation | p. 102 |
| Cells with Two Machines | p. 104 |
| A Cyclic Sequence for m-Machine Dual-Gripper Cells | p. 107 |
| Dual-Gripper Cells with Small Gripper Switch Times | p. 114 |
| Comparing Dual-Gripper and Single-Gripper Cells | p. 116 |
| Comparison of Productivity: Computational Results | p. 122 |
| Efficiently Solvable Cases | p. 128 |
| Single-Gripper Cells with Output Buffers at Machines | p. 131 |
| Dual-Gripper Robotic Cells: Constant Travel Time | p. 141 |
| Lower Bounds and Optimal Cycles: m-Machine Simple Robotic Cells | p. 143 |
| One-Unit Cycles | p. 144 |
| Multi-Unit Cycles | p. 146 |
| Parallel Machines153 | |
| Single-Gripper Robots | p. 154 |
| Definitions | p. 154 |
| k-Unit Cycles and Blocked Cycles | p. 156 |
| Structural Results for k-Unit Cycles | p. 156 |
| Blocked Cycles | p. 157 |
| LCM Cycles | p. 165 |
| Practical Implications | p. 169 |
| Optimal Cycle for a Common Case | p. 169 |
| Fewest Machines Required to Meet Timelines | p. 171 |
| Dual-Gripper Robots | p. 171 |
| Lower Bound on Per Unit Cycle Time | p. 172 |
| An Optimal Cycle | p. 175 |
| Improvement from Using a Dual-Gripper Robot or Parallel Machines | p. 180 |
| Installing a Dual-Gripper Robot in a Simple Robotic Cell | p. 181 |
| Installing Parallel Machines in a Single-Gripper Robot Cell | p. 182 |
| Installing a Dual-Gripper Robot in a Single-Gripper Robotic Cell with Parallel Machines | p. 183 |
| An Illustration on Data from Implemented Cells | p. 187 |
| Multiple-Part-Type Production: Single-Gripper Robots | p. 191 |
| MPS Cycles and CRM Sequences | p. 192 |
| Scheduling Multiple Part-Types in Two-Machine Cells | p. 194 |
| Scheduling Multiple Part-Types in Three-Machine Cells | p. 206 |
| Cycle Time Derivations | p. 207 |
| Efficiently Solvable Special Cases | p. 211 |
| Steady-State Analyses | p. 216 |
| Reaching Steady State for the Sequence CRM(2) | p. 217 |
| Reaching Steady State for the Sequence CRM(6) | p. 225 |
| A Practical Guide to Initializing Robotic Cells | p. 229 |
| Intractable Cycles for Three-Machine Cells | p. 231 |
| MPS Cycles with the Sequence CRM(2) | p. 231 |
| MPS Cycles with the Sequence CRM(6) | p. 238 |
| Complexity of Three-Machine Robotic Cells | p. 244 |
| Scheduling Multiple Part-Types in Large Cells | p. 247 |
| Class U: Schedule Independent Problems | p. 250 |
| Class V1: Special Cases of the TSP | p. 251 |
| Class V2: NP-Hard TSP Problems | p. 253 |
| Class W: NP-Hard Non-TSP Problems | p. 264 |
| Overview | p. 268 |
| Heuristics for Three-Machine Problems | p. 270 |
| A Heuristic Under the Sequence CRM(2) | p. 270 |
| A Heuristic Under the Sequence CRM(6) | p. 273 |
| Computational Testing | p. 274 |
| Heuristics for General Three-Machine Problems | p. 276 |
| Heuristics for Large Cells | p. 281 |
| The Cell Design Problem | p. 284 |
| Forming Cells | p. 285 |
| Buffer Design | p. 288 |
| An Example | p. 292 |
| Computational Testing | p. 293 |
| Multiple-Part-Type Production: Dual-Gripper Robots | p. 297 |
| Two-Machine Cells: Undominated CRM Sequences | p. 300 |
| Two-Machine Cells: Complexity | p. 306 |
| Cycle Time Calculation | p. 306 |
| Strong NP-Completeness Results | p. 312 |
| Polynomially Solvable Problems | p. 318 |
| Analyzing Two-Machine Cells with Small Gripper Switch Times | p. 319 |
| A Heuristic for Specific CRM Sequences | p. 324 |
| A Performance Bound for Heuristic Hard-CRM | p. 325 |
| A Heuristic for Two-Machine Cells | p. 339 |
| Comparison of Productivity: Single-Gripper Vs. Dual-Gripper Cells | p. 340 |
| An Extension to m-Machine Robotic Cells | p. 342 |
| Multiple-Robot Cells | p. 349 |
| Physical Description of a Multiple-Robot Cell | p. 350 |
| Cycles in Multiple-Robot Cells | p. 352 |
| Cycle Times | p. 354 |
| Scheduling by a Heuristic Dispatching Rule | p. 357 |
| Computational Results | p. 358 |
| Applying an LCM Cycle to Implemented Cells | p. 361 |
| No-Wait And Interval Robotic Cells | p. 363 |
| No-Wait Robotic Cells | p. 363 |
| Interval Pick-up Robotic Cells | p. 369 |
| Open Problems | p. 371 |
| Simple Robotic Cells | p. 371 |
| Simple Robotic Cells with Multiple Part Types | p. 376 |
| Robotic Cells with Parallel Machines | p. 376 |
| Stochastic Data | p. 377 |
| Dual-Gripper Robots | p. 377 |
| Flexible Robotic Cells | p. 378 |
| Implementation Issues | p. 378 |
| Using Local Material Handling Devices | p. 378 |
| Revisiting Machines | p. 379 |
| Appendices | |
| p. 383 |
| 1-Unit Cycles | p. 383 |
| 1-Unit Cycles in Classical Notation | p. 384 |
| 1-Unit Cycles in Activity Notation | p. 385 |
| p. 387 |
| The Gilmore-Gomory Algorithm for the TSP | p. 387 |
| The Two-Machine No-Wait Flowshop Problem | p. 387 |
| Formulating a TSP | p. 388 |
| The Gilmore-Gomory Algorithm | p. 389 |
| The Three-Machine No-Wait Flowshop Problem as a TSP | p. 394 |
| Copyright Permissions | p. 409 |
| Index | p. 413 |
| Table of Contents provided by Publisher. All Rights Reserved. |
