A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (Q2489279)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5023531
| 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 scheduling problem with an availability constraint |
scientific article; zbMATH DE number 5023531 |
Statements
A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (English)
0 references
16 May 2006
0 references
Approximation algorithms
0 references
Flow shop scheduling
0 references
Availability constraints
0 references
0 references
0 references
0 references
0.9191555380821228
0 references
0.9006125926971436
0 references
0.8981398940086365
0 references
0.8795417547225952
0 references
