Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
From MaRDI portal
Publication:4272897
DOI10.1287/opre.41.4.743zbMath0782.90037OpenAlexW2018395339MaRDI QIDQ4272897
Lawrence M. Wein, Philippe Chevalier
Publication date: 28 February 1994
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/5319
Brownian motionmean throughputmultistation, multiclass closed queueing networkoptimal dynamic priority sequencing policy
Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (12)
Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy ⋮ Scheduling in a multi-class series of queues with deterministic service times ⋮ Correction: Brownian models of open processing networks: canonical representation of workload ⋮ Dynamic control of Brownian networks: State space collapse and equivalent workload formulations ⋮ A simulation study of new multi-objective composite dispatching rules, CONWIP, and push lot release in semiconductor fabrication ⋮ Allocating work in process in a multiple-product CONWIP system with lost sales ⋮ Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies ⋮ Production control in a two-stage system ⋮ Dynamic scheduling in manufacturing systems using Brownian approximations ⋮ Brownian models of open processing networks: Canonical representation of workload. ⋮ Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies ⋮ Asymptotic loss of priority scheduling policies in closed re-entrant lines: A computational study
This page was built for publication: Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
