Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57399745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strip packing with precedence constraints and strip packing with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks with chain constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks -- An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling Parallel Task Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of adjacent resource scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher‐Dimensional Packing with Order Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Dilworth's Decomposition Theorem for Partially Ordered Sets / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling with irregular costs: complexity, approximability, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time approximation schemes for scheduling malleable parallel tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for scheduling malleable tasks under general precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for scheduling trees of malleable tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional packing problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks / 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: On the complexity of dynamic programming for sequencing problems with precedence constraints / rank
 
Normal rank

Revision as of 09:16, 7 July 2024

scientific article
Language Label Description Also known as
English
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
scientific article

    Statements

    Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (English)
    0 references
    0 references
    0 references
    0 references
    25 February 2014
    0 references
    approximation
    0 references
    scheduling
    0 references
    precedence constraints
    0 references
    makespan
    0 references
    malleable
    0 references
    parallel
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers