An improved algorithm for the two machine flow shop problem with several availability constraints (Q607877)
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 5823105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved algorithm for the two machine flow shop problem with several availability constraints |
scientific article; zbMATH DE number 5823105 |
Statements
An improved algorithm for the two machine flow shop problem with several availability constraints (English)
0 references
6 December 2010
0 references
flow shop scheduling
0 references
availability constraint
0 references
heuristics
0 references
worst case analysis
0 references
polynomially solvable case
0 references
0 references
0 references
0 references
0 references
0 references
0.926500141620636
0 references
0.8980699181556702
0 references
0.8973349928855896
0 references
0.8874650001525879
0 references
