Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q839670 |
||
| Property / author | |||
| Property / author: Qingqin Nong / rank | |||
Revision as of 02:24, 21 February 2024
scientific article
| 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 |
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
