Pages that link to "Item:Q5111718"
From MaRDI portal
The following pages link to On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718):
Displaying 10 items.
- An APTAS for bin packing with clique-graph conflicts (Q832868) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- The 2-valued case of makespan minimization with assignment constraints (Q1941692) (← links)
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← 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)
- Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations (Q6164589) (← 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)
