Dynamic Scheduling of a Two-Server Parallel Server System with Complete Resource Pooling and Reneging in Heavy Traffic: Asymptotic Optimality of a Two-Threshold Policy
نویسندگان
چکیده
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print or online or to submit the papers to another publication.
منابع مشابه
Dynamic Scheduling of a Parallel Server System in Heavy Traffic with Complete Resource Pooling: Asymptotic Optimality of a Threshold Policy
We consider a parallel server queueing system consisting of a bank of buffers for holding incoming jobs and a bank of flexible servers for processing these jobs. Incoming jobs are classified into one of several different classes (or buffers). Jobs within a class are processed on a first-in-first-out basis, where the processing of a given job may be performed by any server from a given (class-de...
متن کاملDynamic Scheduling of a System with Two Parallel Servers in Heavy Traac with Complete Resource Pooling: Asymptotic Optimality of a Continuous Review Threshold Policy 1
rights reserved. Personal scientiic non-commercial use only for individuals with permission from the authors ([email protected]). Abstract This paper concerns a dynamic scheduling problem for a queueing system that has two streams of arrivals to innnite capacity buuers and two (non-identical) servers working in parallel. One server can only process jobs from one buuer, whereas the other se...
متن کاملDynamic Scheduling of a System with Two Parallel Servers in Heavy Traac with Resource Pooling: Asymptotic Optimality of a Threshold Policy 1
This paper concerns a dynamic scheduling problem for a queueing system that has two streams of arrivals to innnite capacity buuers and two (non-identical) servers working in parallel. One server can only process jobs from one buuer, whereas the other server can process jobs from either buuer. The service time distribution may depend on the buuer being served and the server providing the service...
متن کاملHeavy Traffic Analysis of Open Processing Networks with Complete Resource Pooling: Asymptotic Optimality of Discrete Review Policies
We consider a class of open stochastic processing networks, with feedback routing and overlapping server capabilities, in heavy traffic. The networks we consider satisfy the so-called complete resource pooling condition and therefore have one-dimensional approximating Brownian control problems. We propose a simple discrete review policy for controlling such networks. Assuming 2 + ε moments on t...
متن کاملDynamic Control of N-Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic
We consider a class of parallel server systems that are known as N-systems. In an N-system, there are two customer classes that are catered by servers in two pools. Servers in one of the pools are cross-trained and can serve customers from both classes whereas all the servers in the other pool can only serve one of the customer classes. A customer reneges from his queue if his waiting time in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 38 شماره
صفحات -
تاریخ انتشار 2013