Pages that link to "Item:Q1401918"
From MaRDI portal
The following pages link to The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918):
Displaying 27 items.
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification (Q297241) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms (Q862816) (← links)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- The bounded beam search algorithm for the block relocation problem (Q1634080) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- A branch-and-cut algorithm for the restricted block relocation problem (Q2023911) (← links)
- Solution approaches for storage loading problems with stacking constraints (Q2027013) (← links)
- Generalised online colouring problems in overlap graphs (Q2034796) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2149860) (← links)
- The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage (Q2327630) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- New results in two identical machines scheduling with agreement graphs (Q2420580) (← links)
- Track assignment (Q2457297) (← links)
- Batch processing with interval graph compatibilities between tasks (Q2476244) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (Q2484367) (← links)
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859) (← links)
- Comparability graph augmentation for some multiprocessor scheduling problems (Q5961606) (← links)
- An asymptotically optimal algorithm for online stacking (Q6040850) (← links)