Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
From MaRDI portal
Publication:6432072
DOI10.1007/S10107-002-0362-6zbMath1023.90034arXiv2304.01946MaRDI QIDQ6432072
Publication date: 4 April 2023
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Stochastic scheduling theory in operations research (90B36) Markov and semi-Markov decision processes (90C40)
This page was built for publication: Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach