Dynamic Scheduling of a Multiclass Fluid Network

Hong Chen and David D. Yao
Additional contact information
Hong Chen: University of British Columbia, Vancouver, Canada and New Jersey Institute of Technology, Newark, New Jersey
David D. Yao: Columbia University, New York, New York

Operations Research, 1993, vol. 41, issue 6, 1104-1115

Abstract: 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.

Keywords: production/scheduling: dynamic control; resource allocation; programming: linear; parametric; queues: fluid network; multiclass (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.41.6.1104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:41:y:1993:i:6:p:1104-1115

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().