Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time |
scientific article; zbMATH DE number 6047256
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time |
scientific article; zbMATH DE number 6047256 |
Statements
Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (English)
0 references
18 June 2012
0 references
scheduling
0 references
concurrent open shop
0 references
approximation scheme
0 references
0 references
