Some results of the worst-case analysis for flow shop scheduling (Q1296692)
From MaRDI portal
!
WARNING
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 1319890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some results of the worst-case analysis for flow shop scheduling |
scientific article; zbMATH DE number 1319890 |
Statements
Some results of the worst-case analysis for flow shop scheduling (English)
0 references
2 August 1999
0 references
scheduling
0 references
heuristics
0 references
worst-case analysis
0 references
flow-shop
0 references
0 references
0 references
0.9616948
0 references
0.94249773
0 references
0.9271155
0 references
0.9111525
0 references
0.9077316
0 references
0.90675515
0 references
0.88208944
0 references
0.8789181
0 references
