Dynamic scheduling on parallel machines (Q1331960): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(94)90152-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2127960094 / rank | |||
Normal rank | |||
Latest revision as of 08:21, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic scheduling on parallel machines |
scientific article |
Statements
Dynamic scheduling on parallel machines (English)
0 references
12 June 1995
0 references
The authors consider on-line job-scheduling on parallel machines with different network topologies. An on-line scheduling algorithm schedules a collection of parallel jobs with known resource requirements but unknown running times on a parallel machine. Algorithms are considered those that matches upper and lower bounds for scheduling on a two-dimensional mesh.
0 references
scheduling
0 references
parallel machines
0 references
network topologies
0 references
