Level scheduling to minimize schedule length on lots of unit-time jobs (Q803029)
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: Level scheduling to minimize schedule length on lots of unit-time jobs |
scientific article; zbMATH DE number 4199940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Level scheduling to minimize schedule length on lots of unit-time jobs |
scientific article; zbMATH DE number 4199940 |
Statements
Level scheduling to minimize schedule length on lots of unit-time jobs (English)
0 references
1991
0 references
parallel machines
0 references
polynomial-time algorithm
0 references
level scheduling
0 references
0 references
0.7791166305541992
0 references
0.7630482316017151
0 references
0.7619085907936096
0 references
0.7596576809883118
0 references
0.7534401416778564
0 references
