Time-Sharing Service Systems. I
From MaRDI portal
Publication:4157796
DOI10.1137/1119060zbMath0378.60102OpenAlexW2059442555MaRDI QIDQ4157796
Publication date: 1974
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1119060
Related Items
Decomposition method application to a large scale linear programming WIP projection model, Optimal adaptive server allocation in a network, Optimal assignment policy of a single server attended by two queues, The existence of sensitive optimal policies in two multi-dimensional queueing models, Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement, Four proofs of Gittins' multiarmed bandit theorem, Processor-sharing queues: Some progress in analysis, Queueing models of secondary storage devices, Optimal routeing in two-queue polling systems, Control of Patient Flow in Emergency Departments, or Multiclass Queues with Deadlines and Feedback, Stochastic scheduling of parallel queues with set-up costs, Optimal scheduling policies in time sharing service systems, Multi-Actor Markov Decision Processes, On scheduling a multiclass queue with abandonments under general delay costs, Interchange arguments for classical scheduling problems in queues, A fluid approach to large volume job shop scheduling, Sample path methods in the control of queues, The archievable region method in the optimal control of queueing systems; formulations, bounds and policies, Performance evaluation of scheduling control of queueing networks: Fluid model heuristics, Optimal inspection effort and scheduling for a manufacturing process with repair, Dynamic scheduling with uncertain job types, The single-server scheduling problem with convex costs, Approximation results in parallel machines stochastic scheduling, Dynamic priority allocation via restless bandit marginal productivity indices, Denumerable semi-Markov decision chains with small interest rates, Flow time distributions in a \(K\) class \(M/G/1\) priority feedback queue, On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing, Mathematical problems in the theory of processor-sharing queueing systems, Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation, A method for solving stationary equations for priority time-sharing service process in random environment, A queueing network with a single cyclically roving server, On the Gittins index in the M/G/1 queue, Dynamic scheduling in manufacturing systems using Brownian approximations, Multiple feedback at a single-server station, On optimal right-of-way policies at a single-server station when insertion of idle times is permitted, Tax problems in the undiscounted case, Re-entrant lines, A survey of Markov decision models for control of networks of queues, Two-Armed Restless Bandits with Imperfect Information: Stochastic Control and Indexability, Workloads and waiting times in single-server systems with multiple customer classes, Algorithm to find the optimal queueing discipline in a system with branching streams of secondary customers, Optimal intensity control of a multi-class queue, Gittins Index for Simple Family of Markov Bandit Processes with Switching Cost and No Discounting, Branching Bandit Processes, Average Cost Semi-Markov Decision Processes and the Control of Queueing Systems, Optimal adaptive control of priority assignment in queueing systems, Optimal intensity allocation of single-server queueing networks, Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails
