The following pages link to Scheduling with incompatible jobs (Q1343141):
Displayed 36 items.
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Approximating the multi-level bottleneck assignment problem (Q453052) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Models and complexity of multibin packing problems (Q864931) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Probabilistic analysis for scheduling with conflicts (Q924143) (← links)
- Precoloring extension of co-Meyniel graphs (Q995757) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Mutual exclusion scheduling (Q1365931) (← links)
- Uniform machine scheduling with machine available constraints (Q1568243) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- The maximum saving partition problem (Q1779697) (← links)
- Parameterized complexity of vertex colouring (Q1811065) (← links)
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← links)
- Scheduling identical jobs on uniform machines with a conflict graph (Q2273690) (← links)
- A combination of flow shop scheduling and the shortest path problem (Q2354293) (← links)
- Open shop scheduling problems with conflict graphs (Q2357137) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
- An improved algorithm for parallel machine scheduling under additional resource constraints (Q2693796) (← links)
- Data Reduction for Graph Coloring Problems (Q3088272) (← links)
- THE GRAPH-BIN PACKING PROBLEM (Q3224960) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- Storage Yard Management: Modelling and Solving (Q5111125) (← links)
- On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718) (← links)
- Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations (Q6164589) (← links)
- Scheduling with machine conflicts (Q6176548) (← links)
- Scheduling on uniform machines with a conflict graph: complexity and resolution (Q6187242) (← links)