Pages that link to "Item:Q842559"

The following pages link to Scheduling with conflicts: Online and offline algorithms (Q842559):

Displaying 35 items.

• Approximation of the parallel machine scheduling problem with additional unit resources (Q323055) (← links)
• Bounds on contention management algorithms (Q553351) (← links)
• Multiprofessor scheduling (Q1686063) (← links)
• Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (Q1686064) (← links)
• Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
• Restricted assignment scheduling with resource constraints (Q1713408) (← links)
• Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929) (← links)
• Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
• Window-based greedy contention management for transactional memory: theory and practice (Q1938368) (← links)
• Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
• A hybrid metaheuristic for the two-dimensional strip packing problem (Q2069243) (← links)
• Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
• Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2149860) (← links)
• Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← links)
• Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
• Scheduling identical jobs on uniform machines with a conflict graph (Q2273690) (← 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)
• A competitive analysis for balanced transactional memory workloads (Q2429336) (← links)
• Scheduling: agreement graph vs resource constraints (Q2629638) (← links)
• A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
• Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859) (← links)
• An improved algorithm for parallel machine scheduling under additional resource constraints (Q2693796) (← links)
• Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
• Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
• On minimizing dataset transfer time in an acyclic network with four servers (Q2959189) (← links)
• Exploring the Kernelization Borders for Hitting Cycles (Q5009476) (← links)
• Fair Packing of Independent Sets (Q5041187) (← links)
• (Q5092396) (← links)
• On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718) (← links)
• Parameterized complexity of conflict-free set cover (Q5918356) (← links)
• Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
• Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
• Scheduling on uniform machines with a conflict graph: complexity and resolution (Q6187242) (← links)