On single processor scheduling problems with learning dependent on the number of processed jobs (Q350495)
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: On single processor scheduling problems with learning dependent on the number of processed jobs |
scientific article; zbMATH DE number 6662045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On single processor scheduling problems with learning dependent on the number of processed jobs |
scientific article; zbMATH DE number 6662045 |
Statements
On single processor scheduling problems with learning dependent on the number of processed jobs (English)
0 references
7 December 2016
0 references
scheduling
0 references
single processor
0 references
learning effect
0 references
computational complexity
0 references
branch and bound
0 references
heuristic
0 references
0 references
0 references
0 references
0.9005452394485474
0 references
0.8821157813072205
0 references
0.8752477169036865
0 references
0.8748676180839539
0 references
