On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes

DOI10.2307/1427802zbMath0804.90072OpenAlexW2314329761MaRDI QIDQ4278402

Arie Hordijk, Ger Koole

Publication date: 7 February 1994

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

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

zbMATH Keywords

schedulingdynamic programmingstochastic schedulingidentical parallel processorsMarkov decision arrival processmulticlass customerscontrolled tandem networkdependent arrivals

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic systems in control theory (general) (93E03)

Related Items (8)

Zero-sum Markov games and worst-case optimal control of queueing systems ⋮ Assigning a single server to inhomogeneous queues with switching costs ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ Dynamic pricing and scheduling in a multi-class single-server queueing system ⋮ Stochastic scheduling on parallel machines to minimize discounted holding costs ⋮ Undiscounted Markov decision chains with partial information; an algorithm for computing a locally optimal periodic policy ⋮ Optimal server assignment in the case of service times with monotone failure rates ⋮ On Suboptimal Policies in Multiclass Tandem Models

This page was built for publication: On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes