An improved heuristic for two-machine flowshop scheduling with an availability constraint (Q1591549)
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: An improved heuristic for two-machine flowshop scheduling with an availability constraint |
scientific article; zbMATH DE number 1547203
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved heuristic for two-machine flowshop scheduling with an availability constraint |
scientific article; zbMATH DE number 1547203 |
Statements
An improved heuristic for two-machine flowshop scheduling with an availability constraint (English)
0 references
29 March 2001
0 references
two-machine flowshop scheduling
0 references
heuristic
0 references
worst-case error bound
0 references
0 references
0 references
0.96602917
0 references
0 references
0.96023387
0 references
0.9556254
0 references
0.9508753
0 references
0.9424806
0 references
0.93037343
0 references
0.93019235
0 references
0.9276571
0 references
