Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms (Q4361782): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1183463 |
||
| Property / author | |||
| Property / author: Q234013 / rank | |||
Revision as of 11:49, 22 February 2024
scientific article; zbMATH DE number 1080540
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms |
scientific article; zbMATH DE number 1080540 |
Statements
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms (English)
0 references
28 October 1997
0 references
approximation algorithms
0 references
\({\mathcal N}{\mathcal P}\)-hard scheduling problems
0 references
weighted sum of the job completion times
0 references
