A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (Q691393)
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: A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints |
scientific article; zbMATH DE number 6111675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints |
scientific article; zbMATH DE number 6111675 |
Statements
A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (English)
0 references
30 November 2012
0 references
flow shop
0 references
scheduling
0 references
availability constraint
0 references
approximation scheme
0 references
0 references
0 references
0 references
0 references
0 references
0 references
