An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs (Q972619)
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 flow shop scheduling with an availability constraint and nonresumable jobs |
scientific article; zbMATH DE number 5710622
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs |
scientific article; zbMATH DE number 5710622 |
Statements
An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs (English)
0 references
21 May 2010
0 references
flow shop
0 references
worst case analysis
0 references
0 references
0 references
0 references
0 references
0 references
0.9374665
0 references
0.93500835
0 references
0.9232322
0 references
0.9221504
0 references
0.91148657
0 references
0.90366846
0 references
0 references
0.8989787
0 references
