Solving flexible flow-shop problems by LPT and LN scheduling algorithms (Q3517610)
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 5310433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving flexible flow-shop problems by LPT and LN scheduling algorithms |
scientific article; zbMATH DE number 5310433 |
Statements
Solving flexible flow-shop problems by LPT and LN scheduling algorithms (English)
0 references
12 August 2008
0 references
scheduling
0 references
flexible flow shop
0 references
LPT scheduling
0 references
LN scheduling
0 references
0.8491518497467041
0 references
0.8241339921951294
0 references
0.8112403154373169
0 references
