Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

Fundamentals of Queueing Theory

We give a survey up to 1989 on the Steiner tree problems which include the four important cases of euclidean, rectilinear, graphic, phylogenetic and some of their generalizations. We also provide a rather comprehensive and up-to-date bibliography which covers more than three hundred items.

Steiner tree problems

https://isiarticles.com/bundles/Article/pre/pdf/7971.pdf

Review of recent developments in OR/MS research in disaster operations management

Ingredients of Locational Analysis (J. Krarup & P. Pruzan). The p-Median Problem and Generalizations (P. Mirchandani). The Uncapacitated Facility Location Problem (G. Cornuejols, et al.). Multiperiod Capacitated Location Models (S. Jacobsen). Decomposition Methods for Facility Location Problems (T. Magnanti & R. Wong). Covering Problems (A. Kolen & A. Tamir). p-Center Problems (G. Handler). Duality: Covering and Constraining p-Center Problems on Trees (B. Tansel, et al.). Locations with Spatial Interactions: The Quadratic Assignment Problem (R. Burkard). Locations with Spatial Interactions: Competitive Locations and Games (S. Hakimi). Equilibrium Analysis for Voting and Competitive Location Problems (P. Hansen, et al.). Location of Mobile Units in a Stochastic Environment (O. Berman, et al.). Index.

https://link.springer.com/content/pdf/10.1057%2Fjors.1991.208.pdf

Discrete location theory

We propose techniques to improve the usage of wireless spectrum in the context of wireless local area networks (WLANs) using new channel assignment methods among interfering Access Points (APs). We identify new ways of channel re-use that are based on realistic interference scenarios in WLAN environments. We formulate a weighted variant of the graph coloring problem that takes into account realistic channel interference observed in wireless environments, as well as the impact of such interference on wireless users. We prove that the weighted graph coloring problem is NP-hard and propose scalable distributed algorithms that achieve significantly better performance than existing techniques for channel assignment. We evaluate our algorithms through extensive simulations and experiments over an in-building wireless testbed.

/pdf/weighted-coloring-based-channel-assignment-for-wlans-mafmzqxez4.pdf

Weighted coloring based channel assignment for WLANs

Multi-objective evacuation routing in transportation networks

Manufacturing firms are linking their internal processes to external suppliers and customers. The resulting supply chain is often a very large network of activities and resources. Modeling and optimization of such complex systems is a new area of research for which exact analytical results are obviously very difficult if not impossible. We develop a methodology based on analytical queueing networks coupled with nonlinear optimization to design supply chain topologies and evaluate various performance measures. The results obtained from small network configurations as well as from the case study discussed in the paper demonstrate that our approach is a very useful tool to analyze congestion problems and to evaluate the performance of the network topologies.

Queueing networks and the topological design of supply chain systems

Stochastic network evacuation models

Factory Design.- Dilemmas in factory design: paradox and paradigm.- Unreliable Production Lines.- Lean buffering in serial production lines with non-exponential machines.- Analysis of flow lines with Cox-2-distributed processing times and limited buffer capacity.- Performance evaluation of production lines with finite buffer capacity producing two different products.- Automated flow lines with shared buffer.- Integrated quality and quantity modeling of a production line.- Stochastic cyclic flow lines with blocking: Markovian models.- Queueing Network Models of Manufacturing Systems.- Performance analysis of multi-server tandem queues with finite buffers and blocking.- An analytical method for the performance evaluation of echelon kanban control systems.- Closed loop two-echelon repairable item systems.- A heuristic to control integrated multi-product multi-machine production-inventory systems with job shop routings and stochastic arrival, set-up and processing times.- Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism.- A review and comparison of hybrid and pull-type production control strategies.- Stochastic Production Planning and Assembly.- Planning order releases for an assembly system with random operation times.- A multiperiod stochastic production planning and sourcing problem with service level constraints.

James MacGregor Smith

Papers

Multi-objective evacuation routing in transportation networks

Queueing networks and the topological design of supply chain systems

Stochastic network evacuation models

Queueing networks and the topological design of supply chain systems

Stochastic modeling of manufacturing systems : advances in design, performance evaluation, and control issues