Optimal stochastic scheduling of forest networks with switching penalties

DOI10.2307/1427447zbMath0804.60083OpenAlexW1997021128MaRDI QIDQ4306638

Mark P. Van Oyen, Demosthenis Teneketzis

Publication date: 15 January 1995

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427447

zbMATH Keywords

schedulingqueueing networkscouplingmulti-armed banditsstructural properties of optimal policies

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25)

Related Items (8)

Stochastic scheduling of parallel queues with set-up costs ⋮ Dynamic control of a flexible server in an assembly-type queue with setup costs ⋮ Dynamic control of a tandem system with abandonments ⋮ A perpetual search for talents across overlapping generations: a learning process ⋮ Optimal hysteresis for a class of deterministic deteriorating two-armed bandit problem with switching costs. ⋮ Some indexable families of restless bandit problems ⋮ Inventory based allocation policies for flexible servers in serial systems ⋮ Properties of Lagrangian distributions

This page was built for publication: Optimal stochastic scheduling of forest networks with switching penalties