Minimizing total weighted completion time approximately for the parallel machine problem with a single server (Q2448861): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:14, 3 February 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
