Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time |
scientific article |
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
