A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (Q691393): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:41, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints |
scientific article |
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
