Minimizing the total completion time in a single-machine scheduling problem with a learning effect (Q552439)
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 5930127
| 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 learning effect |
scientific article; zbMATH DE number 5930127 |
Statements
Minimizing the total completion time in a single-machine scheduling problem with a learning effect (English)
0 references
21 July 2011
0 references
single-machine
0 references
time-dependent
0 references
learning effect
0 references
total completion time
0 references
SPT rule
0 references
0 references
0 references
0 references
0.962889850139618
0 references
0.932495415210724
0 references
0.9097332954406738
0 references
0.9018837809562684
0 references
0.9009011387825012
0 references
