Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints (Q3423261)
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 5129158
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints |
scientific article; zbMATH DE number 5129158 |
Statements
Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints (English)
0 references
20 February 2007
0 references
open shop
0 references
machine availability
0 references
approximation scheme
0 references
0.9310826659202576
0 references
0.9102233648300172
0 references
0.8838924765586853
0 references
0.8795417547225952
0 references
