Resource constrained scheduling as generalized bin packing

Cites work

Approximation algorithms for combinatorial problems
Bounds for Certain Multiprocessing Anomalies
Bounds for Multiprocessor Scheduling with Resource Constraints
Bounds on Multiprocessing Timing Anomalies
Complexity Results for Multiprocessor Scheduling under Resource Constraints
Fast algorithms for bin packing
scientific article; zbMATH DE number 3473339 (Why is no real title available?)
scientific article; zbMATH DE number 3561065 (Why is no real title available?)
scientific article; zbMATH DE number 3571502 (Why is no real title available?)
scientific article; zbMATH DE number 3449757 (Why is no real title available?)
Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(80)

On lazy bin covering and packing problems
The poset scheduling problem
Bin packing with divisible item sizes
List scheduling bounds for UET systems with resources
Bin packing can be solved within 1+epsilon in linear time
Assembly line balancing as generalized bin packing
Repacking helps in bounded space on-line bin-packing
Bounds on list scheduling of UET tasks with restricted resource constraints
Properties of some ILP formulations of a class of partitioning problems
A branch-and-bound algorithm for the two-dimensional vector packing problem
Multiple-type, two-dimensional bin packing problems: Applications and algorithms
Tight approximations for resource constrained scheduling and bin packing
Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
Bin packing game with a price of anarchy of \(\frac{3}{2}\)
Offline first-fit decreasing height scheduling of power loads
Exact and approximation algorithms for geometric and capacitated set cover problems
A linear time algorithm for restricted bin packing and scheduling problems
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
Algorithms for on-line bin-packing problems with cardinality constraints
Worst-case analysis of the FFH algorithm for online variable-sized bin packing
Selfish vector packing
Packing-based branch-and-bound for discrete malleable task scheduling
Online bin packing with cardinality constraints resolved
On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
The tight absolute bound of First Fit in the parameterized case
Parallel machine scheduling with additional resources: notation, classification, models and solution methods
Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
A two-dimensional vector packing model for the efficient use of coil cassettes
A note on a selfish bin packing problem
Approximation and online algorithms for multidimensional bin packing: a survey
Scheduling selfish jobs on multidimensional parallel machines
Bounds for online bin packing with cardinality constraints
The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
Online two-dimensional vector packing with advice
There is no asymptotic PTAS for two-dimensional vector packing
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
A single machine scheduling problem with two-dimensional vector packing constraints
Procedures for the bin packing problem with precedence constraints
Vector bin packing with heterogeneous bins: application to the machine reassignment problem
The load-balanced multi-dimensional bin-packing problem
Selfish vector packing
A Framework for Distributing Real-Time Functions
On Packing Two-Dimensional Bins
A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
Scheduling unit-time tasks in renewable resource constrained flowshops
Approximation scheduling algorithms: a survey
Vector bin packing with multiple-choice
On the absolute approximation ratio for first fit and related results
Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach
A bin packing game with cardinality constraints under the best cost rule
Dynamic packing with side constraints for datacenter resource management
TOC-based planning and scheduling model
Sequential selection of random vectors under a sum constraint
On-line bin packing ? A restricted survey
Analysis of a first-fit algorithm for the capacitated unit covering problem
scientific article; zbMATH DE number 7559382 (Why is no real title available?)
Online bin packing with cardinality constraints resolved
Online Submodular Maximization Problem with Vector Packing Constraint.
Adaptive Bin Packing with Overflow
Streaming algorithms for bin packing and vector scheduling
Lower bounds and algorithms for the 2-dimensional vector packing problem
On-line scheduling of parallel jobs with runtime restrictions
Tighter bounds of the First Fit algorithm for the bin-packing problem
Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
A 4/3 OPT+2/3 approximation for big two-bar charts packing problem
Renting servers in the cloud: the case of equal duration jobs
Approximation algorithms for time constrained scheduling
Online two-dimensional load balancing
Solving the single-machine scheduling problem with periodical resource constraints
Flight test scheduling: a generic model, lower bounds, and iterated local search
Price-and-branch heuristic for vector bin packing
Classification and evaluation of the algorithms for vector bin packing
One-dimensional bin packing with pattern-dependent processing time
k-times bin packing and its application to fair electricity distribution
Bin packing with thresholds: mathematical models and theoretical results
Resource scheduling with variable requirements over time
Strip packing with precedence constraints and strip packing with release times
The generalized assignment problem: Valid inequalities and facets
Online interval coloring with packing constraints

This page was built for publication: Resource constrained scheduling as generalized bin packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249132)