Performance of Heuristics for a Computer Resource Allocation Problem (Q3313258): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1137/0605017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034640505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing: Maximizing the number of pieces packed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Multifit Scheduling on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:47, 14 June 2024

scientific article
Language Label Description Also known as
English
Performance of Heuristics for a Computer Resource Allocation Problem
scientific article

    Statements

    Performance of Heuristics for a Computer Resource Allocation Problem (English)
    0 references
    0 references
    1984
    0 references
    0 references
    approximation algorithms
    0 references
    worst-case analysis
    0 references
    bin-packing
    0 references
    storage allocation
    0 references
    multiprocessor scheduling
    0 references
    0 references