Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017): 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/0377-2217(93)90243-g / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2040843365 / rank | |||
Normal rank | |||
Latest revision as of 09:07, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times |
scientific article |
Statements
Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (English)
0 references
20 December 1993
0 references
fixed start and finish times
0 references
preemption of jobs
0 references
polynomial-time algorithms
0 references
minimal-cost preemptive solutions
0 references
transportation-network problem
0 references
cyclic scheduling
0 references
\(NP\)-completeness
0 references
