Pages that link to "Item:Q2420580"
From MaRDI portal
The following pages link to New results in two identical machines scheduling with agreement graphs (Q2420580):
Displaying 5 items.
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2149860) (← links)
- New complexity results for shop scheduling problems with agreement graphs (Q2232609) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- Two-machine open shop problem with agreement graph (Q2333794) (← links)
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859) (← links)
