Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times |
scientific article; zbMATH DE number 474845
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times |
scientific article; zbMATH DE number 474845 |
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
