Interval scheduling on identical machines (Q2564884): 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: When Is the Classroom Assignment Problem Hard? / 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: The Fixed Job Schedule Problem with Working-Time Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: A heuristic approach to the bus driver scheduling problem / rank
 
Normal rank

Latest revision as of 09:09, 27 May 2024

scientific article
Language Label Description Also known as
English
Interval scheduling on identical machines
scientific article

    Statements

    Interval scheduling on identical machines (English)
    0 references
    0 references
    0 references
    7 January 1997
    0 references
    interval scheduling
    0 references
    parallel identical machines
    0 references
    job preemption
    0 references

    Identifiers