A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.07.022 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968573124 / rank | |||
Normal rank | |||
Revision as of 03:02, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for some preemptive multiprocessor task scheduling problems |
scientific article |
Statements
A polynomial algorithm for some preemptive multiprocessor task scheduling problems (English)
0 references
25 October 2006
0 references
scheduling
0 references
complexity theory
0 references
multiprocessor tasks
0 references
dedicated processors
0 references
