Optimizing busy time on parallel machines (Q476900): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6375999 / rank
 
Normal rank
Property / zbMATH Keywords
 
interval scheduling
Property / zbMATH Keywords: interval scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
busy time
Property / zbMATH Keywords: busy time / rank
 
Normal rank
Property / zbMATH Keywords
 
resource allocation
Property / zbMATH Keywords: resource allocation / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
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.2014.10.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032570272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating resource allocation and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sleep Management on Multiple Machines for Energy and Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regenerator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total busy time in parallel scheduling with application to optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Busy Time in Multiple Machine Real-time 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: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252722 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:53, 9 July 2024

scientific article
Language Label Description Also known as
English
Optimizing busy time on parallel machines
scientific article

    Statements

    Optimizing busy time on parallel machines (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    interval scheduling
    0 references
    busy time
    0 references
    resource allocation
    0 references
    approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references