Pages that link to "Item:Q2152489"
From MaRDI portal
The following pages link to Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489):
Displaying 6 items.
- Scheduling with incompatible jobs (Q1343141) (← links)
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (Q1686064) (← links)
- Scheduling on a batch processing machine with split compatibility graphs (Q2583507) (← links)
- An improved algorithm for parallel machine scheduling under additional resource constraints (Q2693796) (← links)
- Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments (Q5162169) (← links)
- Approximation algorithms for job scheduling with block-type conflict graphs (Q6568400) (← links)