Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing (Q3297564): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for scheduling parallel jobs on identical clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Multiprocessor Scheduling with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangle packing with one-dimensional resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel jobs on heterogeneous platforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Processing and Applied Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line hierarchical job scheduling on grids with admissible allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online multiple-strip packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate algorithms to pack rectangles into several strips / rank
 
Normal rank

Latest revision as of 02:55, 23 July 2024

scientific article
Language Label Description Also known as
English
Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing
scientific article

    Statements

    Identifiers

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