Complexity of the job insertion problem in multi-stage scheduling (Q2467449)
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: Complexity of the job insertion problem in multi-stage scheduling |
scientific article; zbMATH DE number 5228884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the job insertion problem in multi-stage scheduling |
scientific article; zbMATH DE number 5228884 |
Statements
Complexity of the job insertion problem in multi-stage scheduling (English)
0 references
21 January 2008
0 references
scheduling
0 references
computational complexity
0 references
0.8411667346954346
0 references
0.8157976269721985
0 references
0.8000411987304688
0 references
0.7806292772293091
0 references
