Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337)
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: Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time |
scientific article; zbMATH DE number 2111548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time |
scientific article; zbMATH DE number 2111548 |
Statements
Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (English)
0 references
28 October 2004
0 references
scheduling
0 references
computational complexity
0 references
polynomial time
0 references
0.8784548
0 references
0 references
0.87251455
0 references
0.8644026
0 references
0.8638452
0 references
0.8619936
0 references
0.8617721
0 references
0.8616673
0 references
