Optimal control and scheduling in a multiclass queueing network: results and conjectures

Author

Yang, Ping ; Chen, Hong ; Yao, David D.

Author_Institution

Texas Univ., Dallas, TX, USA

fYear

1990

fDate

5-7 Dec 1990

Firstpage

572

Abstract

Dynamic scheduling and control in queuing networks are addressed. A two-station queuing network with two types of jobs is studied. Type 1 jobs visit stations, 1 and 2 in sequence, and type 2 jobs visit station 1 only. The problem is to control the (external) arrival processes and the service processes, as well as to schedule the server at station 1 among the two types of jobs. The objective is to minimize a discounted cost function over an infinite time horizon. The approach is based on stochastic intensity representation of point processes. The problem is divided into several cases, each corresponding to a certain parameter range. Optimal control and scheduling are derived for some cases. For the other cases, conjectures for the optimality of certain simple threshold policies are presented

Keywords

graph theory; optimal control; queueing theory; scheduling; discounted cost function; dynamic control; dynamic scheduling; infinite time horizon; minimization; multiclass queueing network; optimal control; point processes; scheduling; stochastic intensity representation; two-station queuing network; Books; Cost function; Dynamic scheduling; Intelligent networks; Network servers; Optimal control; Process control; Queueing analysis; Stochastic processes; Stochastic systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 1990., Proceedings of the 29th IEEE Conference on

Conference_Location

Honolulu, HI

Type

conf

DOI

10.1109/CDC.1990.203663

Filename

203663