This paper addresses the study of a linkage network of biserial queues linked to a common server with a multistage flowshop scheduling system having ‘m’ machines or servers in series under fuzzy environment. Waiting lines or queues are commonly occurred both in everyday life and in a variety of business and industrial situations. Also, the flowshop scheduling is an important task when a number ...

Service reliability in a distributed queuing system can be assessed by means of the probability of successfully serving queued tasks in a heterogeneous network of nodes. Moreover, randomness in delays imposed by the communication medium adds to the uncertainties in the shared information among these faulty nodes, which complicates the dynamics of the queuing system. A novel approach based on st...

We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the scheduling of processor repairs in a multiprocessor system in which one repair can be made at a time and the goal is to maximize system utilization. We analyze the performance of a natural greedy index policy for this pro...

It is not an easy task to write a book on queuing networks when a large number of books in the topic have already been published. The authors have written a very timely book on queuing networks which can be used by people working in the area of communication networks. The basics of stochastic process have been discussed in Chapter 1 with queuing networks being introduced in Chapter 2 where the ...

Among the various existing models for the warehousing management, the simultaneous use of private and public warehouses is as the most well-known one. The purpose of this article is to develop a queuing theory-based model for determining the optimal capacity of private warehouse in order to minimize the total corresponding costs. In the proposed model, the available space and budget to create a...

This paper presents a set of simulation studies for comparing the performance of several flow-based scheduling algorithms, namely Weighted Fair Queuing, Self-Clock Fair Queuing, Start-Time Fair Queuing, Virtual Clock, Worst-case Fair Weighted Fair Queuing and Worstcase Fair Weighted Fair Queuing-plus. These algorithms are being considered for IP networks supporting Quality of Service (QoS).

Within the competition in today’s business environment, the design of supply chains becomes more complex than before. This paper deals with the retailer’s location problem when customers choose their vendors, and inventory costs have been considered for retailers. In a competitive location problem, price and location of facilities affect demands of customers; consequently, simultaneous optimiza...

Queuing is common in urban public places. Automatically monitoring and predicting queuing time can not only help individuals to reduce their wait time and alleviate anxiety but also help managers to allocate resources more efficiently and enhance their ability to address emergencies. This paper proposes a novel method to estimate and predict queuing time in indoor environments based on WiFi pos...

BACKGROUND Changes in patient length of stay (the duration of 1 clinic visit) as a result of the introduction of an electronic patient file system forced an anesthesia department to change its outpatient clinic organization. In this study, we sought to demonstrate how the involvement of essential employees combined with mathematical techniques to support the decision-making process resulted in ...