Approximation algorithms for scheduling real-time jobs with multiple feasible intervals (Q853634): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989748081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic priority assignment technique for streams with (m, k)-firm deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Imprecise Computations with Timing Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev's approximation algorithms and applications / rank
 
Normal rank

Latest revision as of 23:15, 24 June 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for scheduling real-time jobs with multiple feasible intervals
scientific article

    Statements