Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect (Q2503085)
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: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect |
scientific article; zbMATH DE number 5053936
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect |
scientific article; zbMATH DE number 5053936 |
Statements
Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect (English)
0 references
13 September 2006
0 references
scheduling
0 references
time-dependent
0 references
learning effect
0 references
single machine
0 references
0.962889850139618
0 references
0.9308719635009766
0 references
0.918337345123291
0 references
0.9078099131584167
0 references
0.9033022522926332
0 references
