Peak demand minimization via sliced strip packing (Q6066765): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Asymptotically optimal scheduling of random malleable demands in smart grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smart-Grid Electricity Allocation via Strip Packing with Slicing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Nonpreemptive Scheduling in a Smart Grid Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Packings in Two Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2.5 times optimal algorithm for packing in two dimensions / 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: Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On contiguous and non-contiguous parallel task scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Demand Strip Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem / 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: On approximating strip packing with a better ratio than 3/2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Pseudo-Polynomial-Time Approximation for Strip Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Approximation for Strip Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and inapproximability results for parallel task scheduling and strip packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closing the Gap for Pseudo-Polynomial Strip Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight (3/2+ε) Approximation for Skewed Strip Packing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Non-contiguous Multiple Organization Packing Problem / 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: Approximation Algorithms for Scheduling Parallel Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithm for Two-Dimensional Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the total profit of rectangles packed into a rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Geometric Knapsack via L-packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Guillotine Separability of Squares and Rectangles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Independent Set and Sparse Subsets of Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and online algorithms for multidimensional bin packing: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS / rank
 
Normal rank

Revision as of 13:04, 21 August 2024

scientific article; zbMATH DE number 7777567
Language Label Description Also known as
English
Peak demand minimization via sliced strip packing
scientific article; zbMATH DE number 7777567

    Statements

    Peak demand minimization via sliced strip packing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 December 2023
    0 references
    peak demand minimization
    0 references
    scheduling
    0 references
    approximation
    0 references
    algorithms
    0 references

    Identifiers