Minimizing total weighted completion time approximately for the parallel machine problem with a single server (Q2448861): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q57633789, #quickstatements; #temporary_batch_1722424008430 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57633789 / rank | |||
Normal rank | |||
Latest revision as of 13:13, 31 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total weighted completion time approximately for the parallel machine problem with a single server |
scientific article |
Statements
Minimizing total weighted completion time approximately for the parallel machine problem with a single server (English)
0 references
5 May 2014
0 references
parallel machine scheduling
0 references
single server
0 references
approximation algorithm
0 references
worst-case analysis
0 references
