Optimal admission control of discrete event systems with real-time constraints (Q5962023): Difference between revisions

The authors deal with the problem of controlling the processing rate of tasks in a discrete event system subject to time constraints. They use a model of a single-server queueing system operating a first-come-first-served basis whose dynamics is a standard max-plus equation. When tasks are assigned a time deadline, the objective is to ensure that as many tasks as possible meet their deadlines, and this can be achieved only by rejecting some removable tasks. In the paper the authors formulate this admission control problem and establish sufficient conditions to derive an optimal solution. In particular, they show that when no future task information is available, idling may be optimal under some specific conditions.