Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms (Q4361782)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms |
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
