Best Matching Theory & Applications

Description

Mismatch or best match? This book demonstrates that best matching of individual entities to each other is essential to ensure smooth conduct and successful competitiveness in any distributed system, natural and artificial. Interactions must be optimized through best matching in planning and scheduling, enterprise network design, transportation and construction planning, recruitment, problem solving, selective assembly, team formation, sensor network design, and more. Fundamentals of best matching in distributed and collaborative systems are explained by providing: § Methodical analysis of various multidimensional best matching processes § Comprehensive taxonomy, comparing different best matching problems and processes § Systematic identification of systems’ hierarchy, nature of interactions, and distribution of decision-making and control functions § Practical formulation of solutions based on a library of best matching algorithms and protocols, ready for direct applications and apps development. Designed for both academics and practitioners, oriented to systems engineers and applied operations researchers, diverse types of best matching processes are explained in production, manufacturing, business and service, based on a new reference model developed at Purdue University PRISM Center: “The PRISM Taxonomy of Best Matching”. The book concludes with major challenges and guidelines for future basic and applied research in the area of best matching. Front Matter....Pages i-xvi Introduction: Best Matching and Best Match....Pages 1-17 The PRISM Taxonomy of Best Matching....Pages 19-42 Mathematical Models of Best Matching....Pages 43-62 Distributed Decision-Making and Best Matching....Pages 63-79 Static and Centralized Matching....Pages 81-123 Dynamic and Distributed Matching....Pages 125-165 Extended Examples of Best Matching....Pages 167-219 Frontiers in Best Matching....Pages 221-228 Back Matter....Pages 229-231