On the complexity of interval scheduling with a resource constraint (Q551193): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5920442 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed job scheduling
Property / zbMATH Keywords: fixed job scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
resource allocation
Property / zbMATH Keywords: resource allocation / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
interval availability
Property / zbMATH Keywords: interval availability / rank
 
Normal rank

Revision as of 12:42, 1 July 2023

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