A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (Q691393): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-011-0281-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002962759 / rank | |||
Normal rank | |||
Revision as of 18:20, 19 March 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
