Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4673630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Is the Classroom Assignment Problem Hard? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-min matching problems with multiple assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games of Boldness, Where the Player Performing the Hardest Task Wins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Resources for Fixed and Variable Job Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Solution for the Channel-Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of (maximum) class scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring a Family of Circular Arcs / rank
 
Normal rank

Revision as of 12:07, 22 May 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
    0 references
    0 references
    20 December 1993
    0 references
    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