On the complexity of interval scheduling with a resource constraint (Q551193): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982134276 / 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: A logarithmic approximation for unsplittable flow on line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling on identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource allocation with time intervals / 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: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / 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: Interval scheduling: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed interval scheduling: models, applications, computational complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for the operational fixed interval scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780409 / rank
 
Normal rank

Latest revision as of 06:30, 4 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of interval scheduling with a resource constraint
scientific article

    Statements

    On the complexity of interval scheduling with a resource constraint (English)
    0 references
    0 references
    0 references
    14 July 2011
    0 references
    scheduling
    0 references
    fixed job scheduling
    0 references
    resource allocation
    0 references
    complexity
    0 references
    interval availability
    0 references

    Identifiers