Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage (Q3883479): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:12, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage |
scientific article |
Statements
Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage (English)
0 references
1979
0 references
batched processing
0 references
minimizing expected access time
0 references
linear storage medium
0 references
scheduling algorithms
0 references
