Stabilizing a Queue Subject to Activity-Dependent Server Performance

We consider a discrete-time system, comprising a first-come-first-served queue, a nonpreemptive server, and a scheduler that governs the assignment of tasks in the queue to the server. The server has an availability state that indicates, at each instant, whether the server is busy working on a task...

Full description

Bibliographic Details

Published in:	IEEE transactions on control of network systems Vol. 8; no. 4; pp. 1579 - 1591
Main Authors:	Lin, Michael, La, Richard J., Martins, Nuno C.
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 01.12.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Availability Discrete time systems Policies Queueing analysis Queues Scheduling algorithms Servers Stability Task scheduling
ISSN:	2325-5870, 2372-2533
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!