Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints (Q3423261): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:37, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints |
scientific article |
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
