Scheduling problem: complexity analysis and polynomially solvable subclasses (Q3125964)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling problem: complexity analysis and polynomially solvable subclasses |
scientific article |
Statements
Scheduling problem: complexity analysis and polynomially solvable subclasses (English)
0 references
23 March 1997
0 references
single server
0 references
finite deterministic flow of claims
0 references
NP- complexity
0 references
polynomial algorithms
0 references
recursive dynamic programming
0 references
