Tight approximations for resource constrained scheduling and bin packing
From MaRDI portal
(Redirected from Publication:1372745)
Recommendations
- Approximation algorithms for scheduling and packing problems
- scientific article; zbMATH DE number 3997164
- Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
- Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
- Approximation algorithms for extensible bin packing
- Approximation algorithms for extensible bin packing
- A tight lower bound for optimal bin packing
- Bounding the running time of algorithms for scheduling and packing problems
- Bounding the running time of algorithms for scheduling and packing problems
Cites work
- scientific article; zbMATH DE number 4152425 (Why is no real title available?)
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 3825546 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 852056 (Why is no real title available?)
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Approximation algorithms for scheduling unrelated parallel machines
- Bin packing can be solved within 1+epsilon in linear time
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Geometric algorithms and combinatorial optimization
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Resource constrained scheduling as generalized bin packing
- Simulating (log c n )-wise independence in NC
- The NP-Completeness of Edge-Coloring
- The probabilistic method yields deterministic parallel algorithms
Cited in
(15)- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
- scientific article; zbMATH DE number 1446768 (Why is no real title available?)
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Resource constrained scheduling on multiple machines
- Approximability results for the resource-constrained project scheduling problem with a single type of resources
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
- Scheduling with an orthogonal resource constraint
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees
- Production, maintenance and resource scheduling: a review
- scientific article; zbMATH DE number 5494075 (Why is no real title available?)
This page was built for publication: Tight approximations for resource constrained scheduling and bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372745)
