A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A PTAS for non-resumable open shop scheduling with an availability constraint |
scientific article |
Statements
A PTAS for non-resumable open shop scheduling with an availability constraint (English)
0 references
13 April 2022
0 references
open shop scheduling
0 references
machine non-availability
0 references
approximation algorithm
0 references
polynomial time approximation scheme
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
