Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Performance Analysis of Closed Queueing Networks
This book deals with the performance analysis of closed queueing networks with general processing times and finite buffer spaces. It offers a detailed introduction to the problem and a comprehensive literature review. Two approaches to the performance of closed queueing networks are presented. One is an approximate decomposition approach, while the second is the first exact approach for finite-capacity networks with general processing times. In this Markov chain approach, queueing networks are analyzed by modeling the entire system as one Markov chain. As this approach is exact, it is well-suited both as a reference quantity for approximate procedures and as extension to other queueing networks. Moreover, for the first time, the exact distribution of the time between processing starts is provided.
Stochastic Dynamic Lot-Sizing in Supply Chains
Companies frequently operate in an uncertain environment and many real life production planning problems imply volatility and stochastics of the customer demands. Thereby, the determination of the lot-sizes and the production periods significantly affects the profitability of a manufacturing company and the service offered to the customers. This thesis provides practice-oriented formulations and variants of dynamic lot-sizing problems in presence of restricted production resources and demand uncertainty. The demand fulfillment is regulated by service level constraints. Additionally, integrated production and remanufacturing planning under demand and return uncertainty in closed-loop supply chains is addressed. This book offers introductions to these problems and presents approximation models that can be applied under uncertainty. Comprehensive numerical studies provide managerial implications. The book is written for practitioners interested in supply chain management and production as well as for lecturers and students in business studies with a focus on supply chain management and operations management.
Ressourcenbeschränkte Projektplanung für flexible Projekte
Flexible Projekte zeichnen sich dadurch aus, dass die Projektstruktur nicht exogen gegeben ist. Im Rahmen der ressourcenbeschränkten Projektplanung für derartige Projekte muss somit nicht nur der zeitliche Ablauf des Projekts geplant werden. Es muss auch festgelegt werden, welche Arbeitsgänge überhaupt ausgeführt werden sollen bzw. welche Projektstruktur realisiert werden soll. Dabei hängt es von den zur Verfügung stehenden Ressourcen und der Zielsetzung des Projekts ab, welche Projektstruktur im spezifischen Anwendungsfall optimal ist. Für diese Planung flexibler Projekte entwickelt Carolin Kellenbrink ein mathematisches Entscheidungsmodell. Zudem präsentiert sie einen Genetischen Algorithmus, mit dem auch praxisrelevante Projekte mit einer großen Anzahl von Arbeitsgängen in sehr kurzer Zeit und mit einer hohen Lösungsgüte geplant werden können.
Prozessplanung in Akut-Krankenhäusern
Eicke Bastian Möller zeigt für den mittelfristigen Planungshorizont einer Operationsabteilung im Krankenhaus auf, wie robuste zyklische Operationspläne unter Berücksichtigung von Unsicherheitsaspekten – insb. Verweil- und Operationsdauer – entwickelt werden können. Die erzeugten Pläne liefern für jede denkbare, zukünftig eintretende Umweltlage gute beziehungsweise akzeptable Lösungen. Ergänzend wird ein analytischer Ansatz zur Beurteilung der Robustheit von Operationsplänen vorgestellt. Das Modellkonzept stellt insgesamt ein unkompliziert zu adaptierendes Planungsinstrument dar, dessen Operationspläne als verlässliche Planungsgrundlage für die übrigen Abteilungen eines Krankenhauses verwendet werden können.
The Quadratic Assignment Problem
The quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Since then the QAP has been object of numerous investigations by mathematicians, computers scientists, ope- tions researchers and practitioners. Nowadays the QAP is widely considered as a classical combinatorial optimization problem which is (still) attractive from many points of view. In our opinion there are at last three main reasons which make the QAP a popular problem in combinatorial optimization. First, the number of re- life problems which are mathematically modeled by QAPs has been continuously increasing and the variety of the fields they belong to is astonishin...
Performance Analysis of Closed Queueing Networks
This book deals with the performance analysis of closed queueing networks with general processing times and finite buffer spaces. It offers a detailed introduction to the problem and a comprehensive literature review. Two approaches to the performance of closed queueing networks are presented. One is an approximate decomposition approach, while the second is the first exact approach for finite-capacity networks with general processing times. In this Markov chain approach, queueing networks are analyzed by modeling the entire system as one Markov chain. As this approach is exact, it is well-suited both as a reference quantity for approximate procedures and as extension to other queueing networks. Moreover, for the first time, the exact distribution of the time between processing starts is provided.
Facility Layout
This book presents a structured approach to develop mathematical optimization formulations for several variants of facility layout. The range of layout problems covered includes row layouts, floor layouts, multi-floor layouts, and dynamic layouts. The optimization techniques used to formulate the problems are primarily mixed-integer linear programming, second-order conic programming, and semidefinite programming. The book also covers important practical considerations for solving the formulations. The breadth of approaches presented help the reader to learn how to formulate a variety of problems using mathematical optimization techniques. The book also illustrates the use of layout formulations in selected engineering applications, including manufacturing, building design, automotive, and hospital layout.
Perishable Inventory Systems
A perishable item is one that has constant utility up until an expiration date (which may be known or uncertain), at which point the utility drops to zero. This includes many types of packaged foods such as milk, cheese, processed meats, and canned goods. It also includes virtually all pharmaceuticals and photographic film, as well as whole blood supplies. This book is the first devoted solely to perishable inventory systems. The book’s ten chapters first cover the preliminaries of periodic review versus continuous review and look at a one-period newsvendor perishable inventory model. The author moves to the basic multiperiod dynamic model, and then considers the extensions of random lifet...
Performance Modeling and Design of Computer Systems
Written with computer scientists and engineers in mind, this book brings queueing theory decisively back to computer science.
Service Science
A comprehensive treatment on the use of quantitative modeling for decision making and best practices in the service industries Making up a significant part of the world economy, the service sector is a rapidly evolving field that is relied on to dictate the public's satisfaction and success in various areas of everyday life, from banking and communications to education and healthcare. Service Science provides managers and students of the service industries with the quantitative skills necessary to model key decisions and performance metrics associated with services, including the management of resources, distribution of goods and services to customers, and the analysis and design of queueing...
