Pages that link to "Item:Q2173300"

The following pages link to Makespan minimization on unrelated parallel machines with a few bags (Q2173300):

Displaying 9 items.

• A 3/2-approximation algorithm for the graph balancing problem with two weights (Q1736801) (← links)
• Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
• Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
• Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← 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)
• Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919347) (← 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)