Scheduling linearly shortening jobs under precedence constraints (Q552447)
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 5930131
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling linearly shortening jobs under precedence constraints |
scientific article; zbMATH DE number 5930131 |
Statements
Scheduling linearly shortening jobs under precedence constraints (English)
0 references
21 July 2011
0 references
time-dependent scheduling
0 references
shortening jobs
0 references
precedence constraints
0 references
polynomial algorithms
0 references
0 references
0 references
0 references
0 references
0.8436152338981628
0 references
0.8236707448959351
0 references
0.8171600103378296
0 references
0.8171597719192505
0 references
0.8149141073226929
0 references
