Computational complexity analysis of single machine scheduling problems with job release dates dependent on resources (Q4233363)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1264427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity analysis of single machine scheduling problems with job release dates dependent on resources |
scientific article; zbMATH DE number 1264427 |
Statements
19 August 1999
0 references
single machine scheduling
0 references
job release dates
0 references
technological precedence constraints
0 references
makespan
0 references
total resource consumption
0 references
0.8726282119750977
0 references
0.8556170463562012
0 references
0.8513330817222595
0 references
Computational complexity analysis of single machine scheduling problems with job release dates dependent on resources (English)
0 references
