Line search method for solving a non-preemptive strictly periodic scheduling problem (Q310329)
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: Line search method for solving a non-preemptive strictly periodic scheduling problem |
scientific article; zbMATH DE number 6625282
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Line search method for solving a non-preemptive strictly periodic scheduling problem |
scientific article; zbMATH DE number 6625282 |
Statements
Line search method for solving a non-preemptive strictly periodic scheduling problem (English)
0 references
8 September 2016
0 references
periodic scheduling
0 references
equilibrium
0 references
propagation mechanism
0 references
0.7769120931625366
0 references
0.7483533024787903
0 references
0.7453277111053467
0 references
0.7452979683876038
0 references
0.7422019839286804
0 references
