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
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/nav.20484 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NAV.20484 / rank | |||
Normal rank | |||
Latest revision as of 03:27, 20 December 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
0 references
