Traffic Control of Two Parallel Stations Using the Optimal Dynamic Assignment Policy

View Sample PDF

Author(s): Seifedine Kadry (American University of the Middle East, Kuwait)
Copyright: 2012
Pages: 18
Source title: Handbook of Research on Industrial Informatics and Manufacturing Intelligence: Innovations and Solutions
Source Author(s)/Editor(s): Mohammad Ayoub Khan (Centre for Development of Advanced Computing, India)and Abdul Quaiyum Ansari (Jamia Millia Islamia, India)
DOI: 10.4018/978-1-4666-0294-6.ch016

Keywords: Business & Management / Business Science Reference / Industrial Informatics

Purchase

View Traffic Control of Two Parallel Stations Using the Optimal Dynamic Assignment Policy on the publisher's website for pricing and purchasing information.

Abstract

In this chapter, the authors study some optimal dynamic policies of assignment to control the entrance of a system. This system is formed of two waiting lines (queues) in parallel. Every line is composed of a server and a waiting room (buffer). Upon arrival to this system, the authors suppose the existence of an assignment policy. The role of the policy is to assign dynamically the customers (the customers here may represent a physical customer in the entrance of a cinema or bank, packets in a computer networks, calls in a telephone system…etc.) to the one or to the other of two lines or it may reject (or assigned to other system). This assignment is done according to policies in order to achieve some performance criterion.

The IRMA Community

Research IRM

Traffic Control of Two Parallel Stations Using the Optimal Dynamic Assignment Policy

Purchase

Abstract

Related Content

IRMA Sponsors