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