Approximation algorithms for time constrained scheduling
From MaRDI portal
(Redirected from Publication:676776)
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1333600 (Why is no real title available?)
- scientific article; zbMATH DE number 512917 (Why is no real title available?)
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- scientific article; zbMATH DE number 772747 (Why is no real title available?)
- scientific article; zbMATH DE number 772760 (Why is no real title available?)
- scientific article; zbMATH DE number 871903 (Why is no real title available?)
- A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
- Mutual exclusion scheduling
- On the hardness of approximating minimization problems
- Precoloring Extension III: Classes of Perfect Graphs
- Precoloring extension. I: Interval graphs
- Resource constrained scheduling as generalized bin packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(40)- Online results for black and white bin packing
- A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width
- An APTAS for bin packing with clique-graph conflicts
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Working time constraints in operational fixed job scheduling
- Linear approximation of execution-time constraints
- The triangle scheduling problem
- New lower bounds for bin packing problems with conflicts
- Online variable-sized bin packing with conflicts
- scientific article; zbMATH DE number 850325 (Why is no real title available?)
- Approximation algorithms for scheduling with reservations
- The maximum flow problem with disjunctive constraints
- Heuristics and lower bounds for the bin packing problem with conflicts
- Scheduling Jobs with Temporal Distance Constraints
- An exact algorithm for the bi-objective timing problem
- Minimum cost flow problem with conflicts
- Two-dimensional packing with conflicts
- scientific article; zbMATH DE number 6378894 (Why is no real title available?)
- Robust multiperiod vehicle routing under customer order uncertainty
- An approximation scheme for bin packing with conflicts
- On the benchmark instances for the bin packing problem with conflicts
- Algorithms for Flows over Time with Scheduling Costs
- Robustly assigning unstable items
- The min-conflict packing problem
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Scheduling real-time computations with separation constraints
- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
- Approximating Bin Packing with Conflict Graphs via Maximization Techniques
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Paths, trees and matchings under disjunctive constraints
- Bin packing with directed stackability conflicts
- Approximation of a batch consolidation problem
- Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal
- scientific article; zbMATH DE number 4133846 (Why is no real title available?)
- Heuristics and matheuristics for a real-life machine reassignment problem
- A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts
- Approximate solution of a resource-constrained scheduling problem
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- A multi-start tabu search based algorithm for solving the warehousing problem with conflict
This page was built for publication: Approximation algorithms for time constrained scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676776)
