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

https://findresearcher.sdu.dk:8443/ws/files/135384983/Supply_chain_network_design_under_uncertainty.pdf

Supply chain network design under uncertainty: A comprehensive review and future research directions

A survey of healthcare facility location

A survey of game-theoretic models of cooperative advertising ☆

Joint advertising, pricing and collection decisions in a closed-loop supply chain

On a cooperative advertising model for a supply chain with one manufacturer and one retailer

Incorporating location, inventory and price decisions into a supply chain distribution network design problem

This paper presents a location-inventory-pricing model for designing the distribution network of a supply chain with price-sensitive demands and inventory-capacity constraints. The supply chain has market power and uses markup pricing. An efficient Lagrangian relaxation algorithm is proposed to solve the model. Our numerical study shows that by moderately increasing the number of possible values for pricing decisions, the model can be used to find near-optimal solutions of a similar location-inventory-pricing problem with continuous pricing decisions. The approach used here to incorporate pricing decisions can be applied to other supply-chain design and planning problems with price-sensitive demands.

A location-inventory-pricing model in a supply chain distribution network with price-sensitive demands and inventory-capacity constraints

Cooperative advertising in a capacitated manufacturer–retailer supply chain: a game‐theoretic approach

This paper considers the design of an immobile service system in which each facility’s service process is subject to the risk of interruptions. The location-capacity decisions and allocations are simultaneously made to maximize the difference between the service provider’s profit and the sum of customers’ transportation and waiting costs. An efficient Lagrangian-based solution algorithm is developed, which solves large-sized instances with up to 50 service facilities and 500 customers in a few seconds. Several sensitivity analyses and managerial insights are presented. The model is also applied to a case study on a logistics network design problem in the zinc mining industry.

Pooya Hoseinpour

Papers

On a cooperative advertising model for a supply chain with one manufacturer and one retailer

Incorporating location, inventory and price decisions into a supply chain distribution network design problem

A location-inventory-pricing model in a supply chain distribution network with price-sensitive demands and inventory-capacity constraints

Cooperative advertising in a capacitated manufacturer–retailer supply chain: a game‐theoretic approach

A profit-maximization location-capacity model for designing a service system with risk of service interruptions