DYNAMIC SCHEDULING OF A MULTICLASS FLUID NETWORK
成果类型：
Article
署名作者：
CHEN, H; YAO, DD
署名单位：
New Jersey Institute of Technology; Columbia University
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.41.6.1104
发表日期：
1993
页码：
1104-1115
关键词：
摘要：
A fluid network is a deterministic network model in which dynamic continuous flows are circulated and processed. among a set of stations. A fluid network often describes the asymptotic behavior of a stochastic queueing network via functional strong law of large numbers. We study the dynamic scheduling of multiple classes of fluid traffic in such a network. An algorithm is developed that systematically solves the dynamic scheduling problem by solving a sequence of linear programs. It generates a policy, in the form of dynamic capacity allocation at each station (among all fluid classes), that consists of a finite set of linear ''pieces'' over the entire time horizon. In a single-station, or equivalently, single-server, network, this solution procedure recovers the priority index set that is optimal for the corresponding discrete queueing model, generally known as Klimov's problem.