You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Multidisciplinary Scheduling: Theory and Applications is a volume of nineteen reviewed papers that were selected from the sixty-seven papers presented during the First Multidisciplinary International Conference of Scheduling (MISTA). This is the initial volume of MISTA—the primary forum on interdisciplinary research on scheduling research. Each paper in the volume has been rigorously reviewed and carefully copyedited to ensure its readability. The MISTA volume focuses on the following leading edge topics: Fundamentals of Scheduling, Multi-Criteria Scheduling, Personnel Scheduling, Scheduling in Space, Scheduling the Internet, Machine Scheduling, Bin Packing, Educational Timetabling, Sports Scheduling, and Transport Scheduling.
‘Network’ is a heavily overloaded term, so that ‘network analysis’ means different things to different people. Specific forms of network analysis are used in the study of diverse structures such as the Internet, interlocking directorates, transportation systems, epidemic spreading, metabolic pathways, the Web graph, electrical circuits, project plans, and so on. There is, however, a broad methodological foundation which is quickly becoming a prerequisite for researchers and practitioners working with network models. From a computer science perspective, network analysis is applied graph theory. Unlike standard graph theory books, the content of this book is organized according to methods for specific levels of analysis (element, group, network) rather than abstract concepts like paths, matchings, or spanning subgraphs. Its topics therefore range from vertex centrality to graph clustering and the evolution of scale-free networks. In 15 coherent chapters, this monograph-like tutorial book introduces and surveys the concepts and methods that drive network analysis, and is thus the first book to do so from a methodological perspective independent of specific application areas.
In today's retail environment, characterized by product proliferation, price competition, expectations of service quality, and advances in technology, many organizations are struggling to maintain profitability. Rigorous analytical methods have emerged as the most promising solution to many of these complex problems. Indeed, the retail industry has emerged as a fascinating choice for researchers in the field of supply chain management. In Retail Supply Chain Management, leading researchers provide a detailed review of cutting-edge methodologies that address the complex array of these problems. A critical resource for researchers and practitioners in the field of retailing, chapters in this book focus on three key areas: (1) empirical studies of retail supply chain practices, (2) assortment and inventory planning, and (3) integrating price optimization into retail supply chain decisions.
Mathematics of Computing -- Parallelism.
In two volumes, Planning Production and Inventories in the Extended Enterprise: A State of the Art Handbook examines production planning across the extended enterprise against a backdrop of important gaps between theory and practice. The early chapters describe the multifaceted nature of production planning problems and reveal many of the core complexities. The middle chapters describe recent research on theoretical techniques to manage these complexities. Accounts of production planning system currently in use in various industries are included in the later chapters. Throughout the two volumes there are suggestions on promising directions for future work focused on closing the gaps. Include...
Probabilistic Analysis of Algorithms begins with a presentation of the "tools of the trade" currently used in probabilistic analyses, and continues with an applications section in which these tools are used in the analysis ofr selected algorithms. The tools section of the book provides the reader with an arsenal of analytic and numeric computing methods which are then applied to several groups of algorithms to analyze their running time or storage requirements characteristics. Topics covered in the applications section include sorting, communications network protocols and bin packing. While the discussion of the various algorithms is sufficient to motivate their structure, the emphasis throu...
In science, engineering and economics, decision problems are frequently modelled by optimizing the value of a (primary) objective function under stated feasibility constraints. In many cases of practical relevance, the optimization problem structure does not warrant the global optimality of local solutions; hence, it is natural to search for the globally best solution(s). Global Optimization in Action provides a comprehensive discussion of adaptive partition strategies to solve global optimization problems under very general structural requirements. A unified approach to numerous known algorithms makes possible straightforward generalizations and extensions, leading to efficient computer-bas...