On Scheduling with Ready Times to Minimize Mean Flow Time (Q3674053): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1093/comjnl/26.4.320 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2043510756 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:33, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Scheduling with Ready Times to Minimize Mean Flow Time |
scientific article |
Statements
On Scheduling with Ready Times to Minimize Mean Flow Time (English)
0 references
1983
0 references
scheduling
0 references
algorithm for sequencing jobs on a single processor
0 references
minimizing the mean flow time
0 references
