Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (Q425519)
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: Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect |
scientific article; zbMATH DE number 6043935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect |
scientific article; zbMATH DE number 6043935 |
Statements
Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (English)
0 references
8 June 2012
0 references
scheduling
0 references
flowshop
0 references
learning effect
0 references
worst-case analysis
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9146357774734496
0 references
0.8969908356666565
0 references
0.8897593021392822
0 references
0.8784276843070984
0 references
