A Greedy On-Line Algorithm for thek-Track Assignment Problem (Q4240132): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1006/jagm.1998.1001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2120501415 / rank | |||
Normal rank | |||
Latest revision as of 20:47, 19 March 2024
scientific article; zbMATH DE number 1283679
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Greedy On-Line Algorithm for thek-Track Assignment Problem |
scientific article; zbMATH DE number 1283679 |
Statements
A Greedy On-Line Algorithm for thek-Track Assignment Problem (English)
0 references
12 January 2000
0 references
\(k\)-track assignment
0 references
scheduling
0 references
greedy on-line algorithms
0 references
