Scheduling with conflicts: Online and offline algorithms
From MaRDI portal
Recommendations
Cites work
- OPTVersusLOADin Dynamic Storage Allocation
- A note on the decomposition of graphs into isomorphic matchings
- An approximation scheme for bin packing with conflicts
- Bounded vertex colorings of graphs
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Fixed-Parameter Tractability and Completeness I: Basic Results
- 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 1559541 (Why is no real title available?)
- scientific article; zbMATH DE number 219236 (Why is no real title available?)
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Multicoloring trees.
- Mutual exclusion scheduling
- On Bin Packing with Conflicts
- Polynomial time approximation schemes for general multiprocessor job shop scheduling
- Restrictions of graph partition problems. I
- Scheduling File Transfers
- Scheduling multiprocessor tasks -- An overview
- Scheduling Parallel Machines On-Line
- Scheduling with conflicts on bipartite and interval graphs
- Scheduling with incompatible jobs
- Sum Multicoloring of Graphs
- The hardness of approximation: Gap location
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- The χt-coloring problem
- Zero knowledge and the chromatic number
Cited in
(48)- Multiprofessor scheduling
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
- Flow shop scheduling problem with conflict graphs
- Restricted assignment scheduling with resource constraints
- Non-clairvoyant scheduling with conflicts for unit-size jobs
- Scheduling jobs on identical machines with agreement graph
- Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
- Window-based greedy contention management for transactional memory: theory and practice
- Approximation of knapsack problems with conflict and forcing graphs
- A hybrid metaheuristic for the two-dimensional strip packing problem
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
- Makespan minimization on unrelated parallel machines with a few bags
- Parameterized complexity of conflict-free matchings and paths
- Scheduling identical jobs on uniform machines with a conflict graph
- Open shop scheduling problems with conflict graphs
- An exact algorithm for parallel machine scheduling with conflicts
- New results in two identical machines scheduling with agreement graphs
- A competitive analysis for balanced transactional memory workloads
- Scheduling with conflicts on bipartite and interval graphs
- Scheduling: agreement graph vs resource constraints
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
- An improved algorithm for parallel machine scheduling under additional resource constraints
- Fair allocation of indivisible items with conflict graphs
- Asynchronous coordination under preferences and constraints
- On minimizing dataset transfer time in an acyclic network with four servers
- Online scheduling with interval conflicts
- Approximation of the parallel machine scheduling problem with additional unit resources
- Online scheduling with interval conflicts
- scientific article; zbMATH DE number 1754640 (Why is no real title available?)
- scientific article; zbMATH DE number 871903 (Why is no real title available?)
- Improved bounds for scheduling conflicting jobs with minsum criteria
- Exploring the kernelization borders for hitting cycles
- Fair Packing of Independent Sets
- Parameterized complexity of conflict-free matchings and paths
- On minimizing the makespan when some jobs cannot be assigned on the same machine
- Bounds on contention management algorithms
- Parameterized complexity of conflict-free set cover
- Conflict free version of covering problems on graphs: classical and parameterized
- Fair allocation algorithms for indivisible items under structured conflict constraints
- An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts
- Scheduling on uniform machines with a conflict graph: complexity and resolution
- Parameterized complexity of shortest path with positive disjunctive constraints
- Even the easiest(?) Graph coloring problem is not easy in streaming!
- On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints
- Minimum sum coloring with bundles in trees and bipartite graphs
- Probabilistic analysis for scheduling with conflicts
This page was built for publication: Scheduling with conflicts: Online and offline algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842559)
