An efficient algorithm for finding ideal schedules (Q766186)
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: An efficient algorithm for finding ideal schedules |
scientific article; zbMATH DE number 6018103
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for finding ideal schedules |
scientific article; zbMATH DE number 6018103 |
Statements
An efficient algorithm for finding ideal schedules (English)
0 references
23 March 2012
0 references
scheduling
0 references
procedence constraints
0 references
ideal schedules
0 references
UET tasks
0 references
0.8900598
0 references
0.8797822
0 references
0.86798424
0 references
0.8614972
0 references
0.8603504
0 references
0.8592142
0 references
