Now showing items 21-30 of 68
Queueing Networks of Random Link Topology: Stationary Dynamics of Maximal Throughput Schedules
(Kluwer Academic Publishers; Springer Science + Business Media, Inc., 2005-05)
In this paper, we study the stationary dynamics of a processing system comprised of several parallel queues and a single server of constant rate. The connectivity of the server to each queue is randomly modulated, taking ...
Large volume, high-performance applications of fibers in civil engineering
(Wiley Periodicals, Inc., 2002-01-18)
This article presents an overview of fiber applications in cementitious composites. The socio-economic considerations surrounding materials development in civil engineering in general, and fiber reinforced cementitious ...
Graphical user interfaces in an engineering educational environment
(Wiley Subscription Services, Inc., A Wiley Company, 2005)
Graphical user interfaces (GUIs) are being increasingly used in the classroom to provide users of computer simulations with a friendly and visual approach to specifying all input parameters and increased configuration ...
A Hit-and-Run approach for generating scale invariant Small World networks
(Wiley Subscription Services, Inc., A Wiley Company, 2009-01)
Hit-and-Run is a well-known class of Markov chain algorithms for sampling from essentially arbitrary distributions over bounded regions of the Euclidean space. We present a class of Small World network models constructed ...
Optimal Pricing and Admission Control in a Queueing System with Periodically Varying Parameters
(Kluwer Academic Publishers; Springer Science+Business Media, 2004-07)
We consider congestion control in a nonstationary queueing system. Assuming that the arrival and service rates are bounded, periodic functions of time, a Markov decision process (MDP) formulation is developed. We show under ...
A Reach and Bound algorithm for acyclic dynamic-programming networks
(Wiley Subscription Services, Inc., A Wiley Company, 2008-08)
Node pruning is a commonly used technique for solution acceleration in a dynamic-programming network. In pruning, nodes are adaptively removed from the dynamic programming network when they are determined not to lie on an ...
Random Demand Satisfaction in Unreliable Production–Inventory–Customer Systems
(Kluwer Academic Publishers; Springer Science+Business Media, 2004-02)
A method for calculating the probability of customer demand satisfaction in production–inventory–customer systems with Markovian machines, finite finished goods buffers, and random demand is developed. Using this method, ...
Control of manufacturing networks which contain a batch processing machine
(Kluwer Academic Publishers; Springer Science+Business Media, 2000-11)
We consider the control of a batch processing machine which is part of a larger manufacturing network of machines. Systems consisting of a batch processing machine and one or more unit-capacity machines in tandem are ...
Analytic Models for When and How to Expedite in Make-to-Order Systems
(Kluwer Academic Publishers; Springer Science+Business Media, 2001-11)
Expediting is defined as using overtime or subcontracting to supplement regular production. This is usually done when the number of backorders has grown to be unacceptably large. In this paper, we consider analytic models ...