A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (Q691393): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s11590-011-0281-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-011-0281-7 / rank | |||
Normal rank | |||
Latest revision as of 01:52, 10 December 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
0 references
0 references
0 references
0 references
0 references
0 references
