Single-machine scheduling problems with the time-dependent learning effect (Q2519645)
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 5498302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single-machine scheduling problems with the time-dependent learning effect |
scientific article; zbMATH DE number 5498302 |
Statements
Single-machine scheduling problems with the time-dependent learning effect (English)
0 references
27 January 2009
0 references
maximum lateness
0 references
completion time
0 references
learning effect
0 references
scheduling
0 references
polynomial time
0 references
0 references
0.932495415210724
0 references
0.9308719635009766
0 references
0.9219961762428284
0 references
0.9152779579162598
0 references
