Pages that link to "Item:Q1003752"
From MaRDI portal
The following pages link to Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752):
Displaying 13 items.
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups (Q967435) (← links)
- Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Scheduling identical jobs on uniform machines with a conflict graph (Q2273690) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Two-machine open shop problem with agreement graph (Q2333794) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Open shop scheduling problems with conflict graphs (Q2357137) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- New results in two identical machines scheduling with agreement graphs (Q2420580) (← links)
- Scheduling: agreement graph vs resource constraints (Q2629638) (← links)
- On partitioning interval graphs into proper interval subgraphs and related problems (Q3174235) (← links)
- Scheduling on uniform machines with a conflict graph: complexity and resolution (Q6187242) (← links)
