Pages that link to "Item:Q2173300"
From MaRDI portal
The following pages link to Makespan minimization on unrelated parallel machines with a few bags (Q2173300):
Displaying 5 items.
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← 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)
- 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)
