Results 1  10
of
12
Multiproduct systems with both setup times and costs: Fluid bounds and schedules
 Operations Research
, 2004
"... This paper considers a multiproduct, singleserver production system where both setup times and costs are incurred whenever the server changes product. The system is maketoorder with a per unit backlogging cost. The objective is to minimize the longrun average cost per unit time. Using a fluid m ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
(Show Context)
This paper considers a multiproduct, singleserver production system where both setup times and costs are incurred whenever the server changes product. The system is maketoorder with a per unit backlogging cost. The objective is to minimize the longrun average cost per unit time. Using a fluid model, we provide a closedform lower bound on system performance. This bound is also shown to provide a lower bound for stochastic systems when scheduling is static, but is only an approximation when scheduling is dynamic. Heavytraffic analysis yields a refined bound that includes secondmoment terms. The fluid bound suggests both dynamic and static scheduling In this paper we consider a production environment where a number of different products are produced on a single machine and setup activities are necessary when switches of product type are made. These setup activities require both time and cost that depend on the specific product type. Throughout the paper we assume that the setups do not depend on the previous product produced
Scheduling in polling systems
, 2007
"... Abstract: We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
Abstract: We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling systems. It illustrates that a large class of scheduling policies behaves similarly in the exhaustive polling model and the standard M/GI/1 model, whereas scheduling policies in the gated polling model behave very differently than in an M/GI/1. 1
PERFORMANCE ANALYSIS OF A TWOQUEUE MODEL WITH AN (M, N)THRESHOLD SERVICE SCHEDULE
, 1999
"... Abstract In this paper, we consider a polling system consisting of twoparallel queues and a single server under an (M, N)threshold nonpreemptive priority service schedule. Two thresholds M and N (0 <: M < N) are set up in one of two queues, say, the second queue. At each epoch of service com ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract In this paper, we consider a polling system consisting of twoparallel queues and a single server under an (M, N)threshold nonpreemptive priority service schedule. Two thresholds M and N (0 <: M < N) are set up in one of two queues, say, the second queue. At each epoch of service completion, the server decides which queue is to be served next according to the control level reached by the number of customers in the second queue. For the queueing model, we carry out the performance analysis by using the transform method and propose an algorithm to compute the generating functions of the stationary joint queue length distributions a t service completion instants. We also determine the LaplaceStieltjes transforms of the waiting time distributions for both queues, and obtain their mean waiting times. 1. In t roduct ion Polling systems used for modeling distributed multiqueue systems sharing a single server such as a communication channel or a processor, have received a considerable amount of attention in the recent literature. Examples of such systems are local area networks (LAN), highspeed Asynchronous Transfer Mode (ATM) networks, multiprocessor systems, distributed computation, and so forth. An excellent survey may be found in Levy and Sidi[23]. See also the detailed discussion and references in Takagif31, 321 on this sub
A Communication Multiplexer Problem: Two Alternating Queues with Dependent RandomlyTimed Gated Regime
, 2002
"... Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time the server resides i ..."
Abstract
 Add to MetaCart
(Show Context)
Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time the server resides in the secondary queue is determined by the dynamic evolution in queue 1. If there is an arrival to queue 1 while the server is still working in queue 0, the latter is immediately gated, and the server completes service there only to the gated jobs, upon which it switches back to the primary queue. We formulate this system as a twoqueue polling model with a single alternating server and with randomlytimed gated (RTG) service discipline in queue 0, where the timer there depends on the arrival stream to the primary queue. We derive LaplaceStieltjes transforms and generating functions for various key variables and calculate numerous performance measures such as mean queue sizes at polling instants and at an arbitrary moment, mean busy period duration and mean cycle time length, expected number of messages transmitted during a busy period and mean waiting times. Finally, we present graphs of numerical results comparing the mean waiting times in the two queues as functions of the relative loads, showing the effect of the RTG regime.
Stochastics and Statistics On
, 2002
"... a dual queueing system with preemptive priority service discipline ..."
(Show Context)
Scheduling in polling systems
"... We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not ..."
Abstract
 Add to MetaCart
(Show Context)
We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling systems. It illustrates that a large class of scheduling policies behaves similarly in the exhaustive polling model and the standard M/GI/1 model, whereas scheduling policies in the gated polling model behave very differently than in an M/GI/1. Key words: polling systems, scheduling policies, exhaustive service, gated service. 1
65 PUBLICATIONS 1,029 CITATIONS SEE PROFILE
"... Feedback control of 2product server with setups and bounded buffers ..."
(Show Context)
unknown title
"... Feedback control of 2product server with setups and bounded buffers ..."
(Show Context)