Pages that link to "Item:Q2273690"
From MaRDI portal
The following pages link to Scheduling identical jobs on uniform machines with a conflict graph (Q2273690):
Displaying 11 items.
- Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers (Q2026982) (← links)
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Open shop scheduling problems with conflict graphs (Q2357137) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments (Q5162169) (← links)
- Scheduling on uniform machines with a conflict graph: complexity and resolution (Q6187242) (← links)
- Approximation algorithms for job scheduling with block-type conflict graphs (Q6568400) (← links)