Now showing items 51-60 of 149
On the Introduction of an Agile, Temporary Workforce into a Tandem Queueing System
(Kluwer Academic Publishers; Springer Science + Business Media, Inc., 2005-10)
We consider a two-station tandem queueing system where customers arrive according to a Poisson process and must receive service at both stations before leaving the system. Neither queue is equipped with dedicated servers. ...
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 ...
Certainty equivalence control with forcing: revisited
(Elsevier, 1989-12)
Certainty equivalence control with forcing has been shown to be optimal for several stochastic adaptive control problems with the average cost per unit time criterion. Recently researchers have started looking at stochastic ...
Design, planning, scheduling, and control problems of flexible manufacturing systems
(Baltzer Science Publishers, Baarn/Kluwer Academic Publishers; J.C. Baltzer AG, Scientific Publishing Company ; Springer Science+Business Media, 1985-01)
The design and use of flexible manufacturing systems (FMSs) involve some intricate operations research problems. FMS design problems include, for example, determining the appropriate number of machine tools of each type, ...
Software Process Models and Project Performance
(Kluwer Academic Publishers; Springer Science+Business Media, 1999-10)
In this paper we review the progress in software process research and the role of process improvement in enhancing business outcomes of software projects. We first describe the process view of software development. Next, ...
Dynamic programming for computer register allocation
(Elsevier, 1977)
A procedure for optimal index register allocation in loops is described. The procedure is a result of the dynamic programming formulation of the index register allocation problem for other than straightline code. An example ...
Linear independence of root equations for M/G /1 type Markov chains
(Kluwer Academic Publishers; J.C. Baltzer AG, Science Publishers ; Springer Science+Business Media, 1995-09)
There is a classical technique for determining the equilibrium probabilities of M/G/1 type Markov chains. After transforming the equilibrium balance equations of the chain, one obtains an equivalent system of equations in ...
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 ...