Queueing network modelling of flexible manufacturing system using mean value analysis

In the present investigation, we develop queueing model for the performance prediction of flexible manufacturing systems (FMSs) with a multiple discrete material-handling devices (MHD). An iterative method has been suggested using mean value analysis (MVA) for the state-dependent routing. Two queueing network models are considered to determine the material-handling device interference. In the first one, we model the interference from the MHD by inflating the station service times but neglect queueing at the MHD. In another network, the queueing for the MHD is taken into consideration. The performance of FMS configuration is obtained by iterating between two networks. The suggested algorithms demonstrate better results than the algorithm used by earlier workers for single MHD. Some performance indices viz. throughput, mean service time, mean waiting time, etc. are obtained. Numerical results are provided to highlight the effect of the system parameters on performance indices, which are further evaluated by using neuro-fuzzy controller system to validate the tactability of soft computing approach.     

A difference equation approach for analysing a batch service queue with the batch renewal arrival process

We consider an infinite buffer single server queue wherein customers arrive according to the batch renewal arrival process and are served in batches following the random serving capacity rule. The service-batch times follow exponential distribution. This model has been studied in the past using the embedded Markov chain technique and probability generating function. In this paper we provide an alternative yet simple methodology to carry out the whole analysis which is based on the supplementary variable technique and the theory of difference equations. The procedure used here is simple in the sense that it does not require the complicated task of constructing the transition probability matrix. We obtain explicit expressions of the steady-state system-content distribution at pre-arrival and arbitrary epochs in terms of roots of the associated characteristic equation. We also present few numerical results in order to illustrate the computational procedure.     

A Petri net approach to the modelling and analysis of flexible manufacturing systems

In this paper we present an approach for modelling and analyzing flexible manufacturing systems (FMSs) using Petri nets. In this approach, we first build a Petri net model (PNM) of the given FMS in a bottom-up fashion and then analyze important qualitative aspects of FMS behaviour such as existence/absence of deadlocks and buffer overflows. The basis for our approach is a theorem we state and prove for computing the invariants of the union of a finite number of Petri nets when the invariants of the individual nets are known. We illustrate our approach using two typical manufacturing systems: an automated transfer line and a simple FMS.A shorter version of this paper was presented at the 1st ORSA/TIMS Special Interest Conference on FMSs, University of Michigan, Ann Arbor, August 1984.     

Time-dependent analysis of a queue with batch arrivals andn levels of nonpreemptive priority

A queueing system with batch arrivals andn classes of customers with nonpreemptive priorities between them is considered. Each batch arrives according to the Poisson distribution and contains customers of all classes while the service times follow arbitrary distributions with different probability density functions for each class. For such a model the system states probabilities both in the transient and in the steady state are analysed and also expressions for the Laplace transforms of the busy period densities for each class and for the general busy period are obtained.     

Performance analysis of a constrained resource sharing system

We consider a queueing system where the servers are arranged in a circle, and each arriving customer requires a pair of resources that is shared by its server with the respective neighbors on either side. If either resource is being used, the customer is denied service. Customers arrive at each server according to independent Poisson processes, and lengths of service times at each server have an exponential distribution. We derive a closed-form formula for the expected fraction of busy servers at any time in terms of the number of servers and the utilization factor (defined as the arrival rate times the mean service-time duration). This allows us to evaluate system performance when these parameters are varied, and to determine whether denying service to arrivals at alternate servers improves performance. We relate the system to Dijkstra's dining philosophers problem, which is an abstraction for resource sharing in an operating system. This revised version was published online in June 2006 with corrections to the Cover Date.     

Development of a model for a two-station serial transfer line subject to machine and buffer failure

In modern automated production lines, it is common to connect pairs of machines with mechanical storage devices in order to provide buffering between processing stations. Since these devices are mechanical, they are prone to failure. Previous research concerning the analytical modeling of a class of production lines, the serial transfer line, assumes that these buffers are completely reliable. The concept of an unreliable buffer is introduced and an analytic model of a two machine line with an unreliable buffer is developed. It is proposed that this model will form the foundation for an analytic model of the more complex K > 2 machine serial transfer line with unreliable buffers.     

Sensitivity of optimal prices to system parameters in a steady-state service facility

We consider the problem of maximizing the long-run average reward in a service facility with dynamic pricing. We investigate sensitivity of optimal pricing policies to the parameters of the service facility which is modelled as an M/M/s/K$M/M/s/K$ queueing system. Arrival process to the facility is Poisson with arrival rate a decreasing function of the price currently being charged by the facility. We prove structural results on the optimal pricing policies when the parameters in the facility change. Namely, we show that optimal prices decrease when the capacity of the facility or the number of servers in the facility increase. Under a reasonable assumption, we also show that optimal prices increase as the overall demand for the service provided by the facility increases or when the service rate of the facility decreases. We illustrate how these structural results simplify the required computational effort while finding the optimal policy.     

Performance analysis of GI/M/1 queue with working vacations and vacation interruption

In this paper, we analyze a single-server vacation queue with a general arrival process. Two policies, working vacation and vacation interruption, are connected to model some practical problems. The GI/M/1 queue with such two policies is described and by the matrix analysis method, we obtain various performance measures such as mean queue length and waiting time. Finally, using some numerical examples, we present the parameter effect on the performance measures and establish the cost and profit functions to analyze the optimal service rate η during the vacation period.     

A technique for on-line sensitivity analysis of flexible manufacturing systems

The recent perturbation analysis approach to discrete event systems is applied to flexible manufacturing systems (FMS). While analytic (queueing) models are useful in preliminary design of such systems, they are not accurate enough at the detailed design/operation stage. Thus, experimentation on detailed simulations or on the actual system has been the way to optimize system performance. Perturbation analysis allows us to derive the sensitivity of system performance, with respect to several design/operating parameters, by observing a single experiment (and without having to actually alter the parameters — often a costly operation). Thus, observation of one experiment can give accurate directions for the improvement of several parameter values. Here we give a simulation example illustrating how perturbation analysis could be used on-line on an FMS to improve its performance, including reducing its operating cost. Experimental results are also presented validating the estimates obtained from this technique.Work supported by U.S. Office of Naval Research Contracts N00014-75-C-0648 and N00014-79-C-0776, and NSF Grant ENG78-15231, at Harvard University.A preliminary version of this paper appeared in the Proc. 1st ORSA/TIMS Conf. on Flexible Manufacturing Systems, August 1984. This version includes two appendices, which relate to implementation of the technique described in the main body of the paper.     

Transient analysis of a Markovian queue with deterministic rejection

We analyze the transient behavior of the M/M/1+D queue. Considering an Erlang distribution for customers’ waiting time, we approximate the real system by a Markov chain. We obtain the Laplace Transform of the transient probabilities in the approximated model and the Laplace transform of the main performance measures for the real system. We next analyze the busy period of this queue. One interesting insight is that the busy period of the unstable M/M/s queue has a finite coefficient of variation.     

Calculation of output characteristics of a priority queue through a busy period analysis

In this paper, we analyze some output characteristics of a discrete-time two-class priority queue by means of probability generating functions. Therefore, we construct a Markov chain which – after analysis – provides a.o. the probability generating functions of the lengths of the busy periods of both classes. It is furthermore shown how performance measures, related to the output process, are calculated from these functions. The queueing model is kept fairly simple to explain the method of analysis of the busy periods and the output characteristics of priority queues as clearly as possible.     

Robustness of perturbation analysis estimators for queueing systems with unknown distributions

Sample-path-based stochastic gradient estimators for performance measures of queueing systems rely on the assumption that a probability distribution of the random vector of interest (e.g., a service or interarrival time sequence) is given. In this paper, we address the issue of dealing with unknown probability distributions and investigate the robustness of such estimators with respect to possibly erroneous distribution choices. We show that infinitesimal perturbation analysis (IPA) can be robust in this sense and, in some cases, provides distribution-independent estimates. Comparisons with other gradient estimators are provided, including experimental results. We also show that finite perturbation analysis (FPA), though only providing gradient approximations, possesses some attractive robustness properties with respect to unknown distribution parameters. An application of FPA estimation is included for a queueing system performance optimization problem involving customers with real-time constraints.This work was supported in part by the National Science Foundation Grant ECS-88-01912 and by the Office of Naval Research Contract N00014-87-K-0304.The authors wish to thank Dr. Jack Holtzman for several useful comments and suggestions.     

Optimal regulation of the service rate for a queue with finite waiting space

The optimal control for the service rate of a single-server queue with limited waiting space is derived. Costs are associated with providing the service and with waiting. A comparison with the traditional steady-state result is made.     

Hierarchical production control of a flexible manufacturing system

A hierarchical production control framework for a flexible manufacturing system is proposed. The machines in the system are subject to failures in a wide spectrum band. At first, failures are clustered near some discrete points on the failure spectrum in order to define the hierarchical model. Each level in the hierarchy corresponds to a discrete point on the failure spectrum. At each level, faster varying failures are modelled by their mean behaviour, and more slowly varying failures are treated as static. Then, a hierarchical controller of multiple time scale type is proposed. System control at each level is based on the work of Kimemia and Gershwin. Simulation results conclude the paper.     

Discrete-event modelling of an urban transportation system

The modelling of an urban transportation system is addressed. The transportation network is modelled as an oriented graph in which nodes represent single-mode or intermodal stations, integrating different transportation services. Its characteristics make it suitable to model the network as a Discrete Event System. In introducing the model proposed, attention is paid to the definition of all its components, but particular care is necessary for the identification of the probability distributions of the stochastic variables. The validation procedure performed to check the reliability of the model is described in detail. Some numerical results about a case study are presented and discussed.     

Fleet-sizing and service availability for a vehicle rental system via closed queueing networks

In this paper, we address the problem of determining the optimal fleet size for a vehicle rental company and derive analytical results for its relationship to vehicle availability at each rental station in the company’s network of locations. This work is motivated by the recent surge in interest for bicycle and electric car sharing systems, one example being the French program Vélib (2010). We first formulate a closed queueing network model of the system, obtained by viewing the system from the vehicle’s perspective. Using this framework, we are able to derive the asymptotic behavior of vehicle availability at an arbitrary rental station with respect to fleet size. These results allow us to analyze imbalances in the system and propose some basic principles for the design of system balancing methods. We then develop a profit-maximizing optimization problem for determining optimal fleet size. The large-scale nature of real-world systems results in computational difficulties in obtaining this exact solution, and so we provide an approximate formulation that is easier to solve and which becomes exact as the fleet size becomes large. To illustrate our findings and validate our solution methods, we provide numerical results on some sample networks.     

Discrete-time analysis of a classified multi-server queue with burst arrivals and a shared buffer

We study a discrete-time, classified multi-server queue with a shared buffer. There arem servers and each server belongs to one ofk classes (mk), so thatk kinds of jobs can be served in the system. We characterize a bursty arrival process using bursts which consist of the same kind of jobs. Once the first job of a burst arrives at the queue, the successive jobs will arrive on every time slot until the last job of the burst arrives. The numbers of jobs of a burst and the inter-arrival times of bursts are assumed to be i.i.d., respectively, and the service time is assumed to be equal to one slot. We propose an efficient numerical method to exactly obtain the job loss probability, the waiting time distribution and the mean queue length. We apply this model to the ATM switch with a shared buffer and obtain the performance measures. Numerical results show the advantage of the ATM switch with a shared buffer compared to the one with output buffers.     

Synchronized abandonments in a single server unreliable queue

We consider a single server unreliable queue represented by a 2-dimensional continuous-time Markov chain. At failure times, the present customers leave the system. Moreover, customers become impatient and perform synchronized abandonments, as long as the server is down. We analyze this model and derive the main performance measures using results from the basic q-hypergeometric series.     

On the optimal control of a single-server queueing system: Comment

In a recent paper by Scott and Jefferson, the optimal control of the service rate for a single-server queue with limited waiting space is treated by the maximum principle. We show that their control policies are necessarily suboptimal. Characterizations for optimal control are derived and used to obtain corresponding optimal trajectories in both nonsingular and singular regions.