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. |
Normalize DOI. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.22.3.513 / rank | |||
| 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.22.3.513 / rank | |||
Normal rank | |||
Latest revision as of 22:09, 29 December 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
