Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms (Q4361782): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Q234013 / rank | |||
| Property / author | |||
| Property / author: Joel M. Wein / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2148204686 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:15, 19 March 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
