Pages that link to "Item:Q2357137"
From MaRDI portal
The following pages link to Open shop scheduling problems with conflict graphs (Q2357137):
Displaying 12 items.
- Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
- Approximation algorithms for two-machine flow-shop scheduling with a conflict graph (Q1790974) (← links)
- New complexity results for shop scheduling problems with agreement graphs (Q2232609) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- Scheduling identical jobs on uniform machines with a conflict graph (Q2273690) (← links)
- Two-machine open shop problem with agreement graph (Q2333794) (← links)
- The representation of partially-concurrent open shop problems (Q2398435) (← links)
- New results in two identical machines scheduling with agreement graphs (Q2420580) (← links)
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)
- Scheduling on uniform machines with a conflict graph: complexity and resolution (Q6187242) (← links)
