A just-in-time scheduling problem with two competing agents (Q2228372)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A just-in-time scheduling problem with two competing agents |
scientific article; zbMATH DE number 7311793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A just-in-time scheduling problem with two competing agents |
scientific article; zbMATH DE number 7311793 |
Statements
A just-in-time scheduling problem with two competing agents (English)
0 references
17 February 2021
0 references
scheduling
0 references
preemption
0 references
competing agents
0 references
just-in-time job
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9110044240951538
0 references
0.901109516620636
0 references
0.8715556263923645
0 references
0.8712608814239502
0 references
0.8576447367668152
0 references
