Dynamic Scheduling of a Multiclass Queue: Discount Optimality

From MaRDI portal
Publication:4082788

DOI10.1287/opre.23.2.270zbMath0321.60073OpenAlexW2105711971MaRDI QIDQ4082788

J. Michael Harrison

Publication date: 1975

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.23.2.270




Related Items

Optimal control of single-server queueing networksOptimal assignment policy of a single server attended by two queuesOn the optimization of two-class work-conserving parameterized scheduling policiesPerformance of static priority rules for shared facilities in a remanufacturing shop with disassembly and reassemblyFour proofs of Gittins' multiarmed bandit theoremStochastic scheduling of parallel queues with set-up costsMulti-Actor Markov Decision ProcessesOptimal control of multiclass parallel service systemsInterchange arguments for classical scheduling problems in queuesOptimal myopic policies and index policies for stochastic scheduling problemsLinear programming model for the optimal control of a queueing networkThe archievable region method in the optimal control of queueing systems; formulations, bounds and policiesPerformance evaluation of scheduling control of queueing networks: Fluid model heuristicsSensitivity analysis of machine interference in manufacturing systemsDynamic scheduling with uncertain job typesThe single-server scheduling problem with convex costsOptimal schedule of elective surgery operations subject to disruptions by emergenciesApproximation results in parallel machines stochastic schedulingBertrand equilibria and efficiency in markets for congestible network servicesOptimality of routing and servicing in dependent parallel processing systemsAn Overview for Markov Decision Processes in Queues and NetworksOptimal inspection policies for a manufacturing stationLagrangian relaxation and constraint generation for allocation and advanced schedulingMultiple feedback at a single-server stationA survey of Markov decision models for control of networks of queuesScheduling policies for an antiterrorist surveillance systemDynamic admission control for loss systems with batch arrivalsOptimal intensity control of a multi-class queueK competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimalOptimal intensity allocation of single-server queueing networks