Pages that link to "Item:Q1761988"
From MaRDI portal
The following pages link to Scheduling jobs on identical machines with agreement graph (Q1761988):
Displaying 13 items.
- Approximation of the parallel machine scheduling problem with additional unit resources (Q323055) (← links)
- Flow shop scheduling problem with conflict graphs (Q1708533) (← 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)
- Scheduling identical jobs on uniform machines with a conflict graph (Q2273690) (← links)
- Two-machine open shop problem with agreement graph (Q2333794) (← links)
- Open shop scheduling problems with conflict graphs (Q2357137) (← links)
- New results in two identical machines scheduling with agreement graphs (Q2420580) (← links)
- Scheduling: agreement graph vs resource constraints (Q2629638) (← 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)
- Storage Yard Management: Modelling and Solving (Q5111125) (← links)
- Scheduling on uniform machines with a conflict graph: complexity and resolution (Q6187242) (← links)
