Browsing by Subject "Queueing systems"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Diffusion approximation in overloaded switching queueing models
    (Springer, 2002) Anisimov, V. V.
    The asymptotic behavior of a queueing process in overloaded state-dependent queueing models (systems and networks) of a switching structure is investigated. A new approach to study fluid and diffusion approximation type theorems (without reflection) in transient and quasi-stationary regimes is suggested. The approach is based on functional limit theorems of averaging principle and diffusion approximation types for so-called Switching processes. Some classes of state-dependent Markov and non-Markov overloaded queueing systems and networks with different types of calls, batch arrival and service, unreliable servers, networks (MSM,Q/MSM,Q/1/∞)r switched by a semi-Markov environment and state-dependent polling systems are considered.
  • Thumbnail Image
    ItemOpen Access
    Receding horizon control of mixed line flow shop systems
    (2011) Gokbayrak, K.
    We consider reliable mixed line flow shop systems that are composed of controllable and uncontrollable machines. These systems are assumed to receive arrivals at random instants and process jobs deterministically in the order of arrival so as to depart them before their deadlines that are revealed at the time of arrival. We model these flow shops as serial networks of queues operating under a non-preemptive first-come-first-served policy. Defining completion-time costs for jobs and process costs at controllable machines, a stochastic convex optimization problem is formulated where the control variables are the constrained service times of jobs at the controllable machines. As an on-line solution method to determine these service times, we propose a receding horizon controller, which solves a deterministic problem at each decision instant. We quantify the available future information by the look-ahead window size. Numerical examples demonstrate the value of information and that the no-waiting property of the full-information case is not observed in the partial-information case.