Optimal admission control of discrete event systems with real-time constraints (Q5962023): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4371833 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An exact method to minimize the number of tardy jobs in single machine scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal control of two-stage discrete event systems with real-time constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4252722 / rank | |||
Normal rank |
Latest revision as of 05:57, 3 July 2024
scientific article; zbMATH DE number 5786407
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal admission control of discrete event systems with real-time constraints |
scientific article; zbMATH DE number 5786407 |
Statements
Optimal admission control of discrete event systems with real-time constraints (English)
0 references
16 September 2010
0 references
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.
0 references
discrete even systems
0 references
control theory
0 references
0 references
0 references