Two-machine flow shop problems with availability constraints (Q2887149)
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: Two-machine flow shop problems with availability constraints |
scientific article; zbMATH DE number 6041549
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-machine flow shop problems with availability constraints |
scientific article; zbMATH DE number 6041549 |
Statements
1 June 2012
0 references
scheduling
0 references
flow shop
0 references
availability constraint
0 references
approximation algorithm
0 references
competitive ratio
0 references
Two-machine flow shop problems with availability constraints (English)
0 references
0.9393638968467712
0 references
0.9173632264137268
0 references
0.9119006991386414
0 references
0.908706784248352
0 references
