Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
type: Item
instance of: scholarly article
zbMATH Open document ID: 1253.68356
DOI: 10.1142/S1793830911001413
author: Marin Bougeret
author: Pierre-Francois Dutot
author: Christina Robenek
author: Klaus Jansen
author: Denis Trystram
published in: Discrete Mathematics, Algorithms and Applications
publication date: 2012-08-27T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6072523
zbMATH Keywords: strip packing
zbMATH Keywords: scheduling parallel jobs
zbMATH Keywords: malleable jobs
MaRDI profile type: Publication
cites work: Packing d-Dimensional Bins in d Stages
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: Approximate max-min resource sharing for structured concave optimization
cites work: Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
cites work: Rectangle packing with one-dimensional resource augmentation
cites work: A near-optimal solution to a two-dimensional cutting stock problem
cites work: Fast Approximation Algorithms for Knapsack Problems
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2
cites work: Approximate algorithms to pack rectangles into several strips
title: Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
description: scientific article; zbMATH DE number 6072523