Scheduling preemptive jobs with precedence constraints on parallel machines (Q1847175): Difference between revisions

From MaRDI portal
Changed an 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: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Interval-Ordered Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst Case Analysis of Two Scheduling Algorithms / rank
 
Normal rank

Latest revision as of 18:37, 4 June 2024

scientific article
Language Label Description Also known as
English
Scheduling preemptive jobs with precedence constraints on parallel machines
scientific article

    Statements

    Scheduling preemptive jobs with precedence constraints on parallel machines (English)
    0 references
    0 references
    17 November 2002
    0 references
    preemptive scheduling
    0 references
    interval order
    0 references
    forest
    0 references
    linear programming
    0 references

    Identifiers