The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model (Q712692)
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: The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model |
scientific article; zbMATH DE number 6094594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model |
scientific article; zbMATH DE number 6094594 |
Statements
The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model (English)
0 references
17 October 2012
0 references
scheduling
0 references
learning
0 references
computational complexity
0 references
dynamic programming
0 references
metaheuristic
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9085783362388612
0 references
0.8967348337173462
0 references
0.8882896304130554
0 references
0.8864832520484924
0 references
0.8857666254043579
0 references
