Scheduling with machine conflicts
From MaRDI portal
Publication:6176548
DOI10.1007/978-3-031-18367-6_3arXiv2102.08231OpenAlexW3211357163MaRDI QIDQ6176548
Linda Kleist, Moritz Buchem, Daniel Schmidt genannt Waldschmidt
Publication date: 25 July 2023
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.08231
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restrictions of graph partition problems. I
- Bounded vertex colorings of graphs
- Equitable colorings of bounded treewidth graphs
- Parallel machine scheduling problems with a single server
- Mutual exclusion scheduling with interval graphs or related classes. I
- Approximation schemes for scheduling on parallel machines
- Scheduling with incompatible jobs
- Restricted coloring models for timetabling
- Mutual exclusion scheduling
- Parallel machine scheduling with a common server
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
- MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
- Complexity results for parallel machine problems with a single server
- Equal processing and equal setup time cases of scheduling parallel machines with a single server
- Single-server parallel-machine scheduling with loading and unloading times
- Scheduling two parallel machines with a single server: the general case
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Closing the Gap for Makespan Scheduling via Sparsification Techniques
- Algorithms for Scheduling Independent Tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling master-slave multiprocessor systems
- The approximation of maximum subgraph problems
- On minimizing the makespan when some jobs cannot be assigned on the same machine
- On the optimality of approximation schemes for the classical scheduling problem
- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Combinatorial optimization. Theory and algorithms
- Buffer minimization with conflicts on a line
- Scheduling parallel machines with a single server: Some solvable cases and heuristics
- Scheduling with machine conflicts
This page was built for publication: Scheduling with machine conflicts
