A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (Q732786): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11590-009-0137-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-009-0137-6 / rank | |||
Normal rank | |||
Revision as of 08:32, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints |
scientific article |
Statements
A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (English)
0 references
15 October 2009
0 references
flow shop scheduling
0 references
availability constraint
0 references
approximation algorithms
0 references
error bound
0 references
0 references
0 references
0 references
0 references
