The complexity of a cyclic scheduling problem with identical machines and precedence constraints (Q1278237)
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 1252854
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of a cyclic scheduling problem with identical machines and precedence constraints |
scientific article; zbMATH DE number 1252854 |
Statements
The complexity of a cyclic scheduling problem with identical machines and precedence constraints (English)
0 references
1996
0 references
cyclic scheduling
0 references
computational analysis
0 references
optimization
0 references
0 references
0.8581640124320984
0 references
0.8433352112770081
0 references
0.8232916593551636
0 references
0.8194231390953064
0 references
0.8188150525093079
0 references
