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 this page instead for the normal view: Minimizing the total completion time in a single-machine scheduling problem with a learning effect |
scientific article; zbMATH DE number 5930127
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
