Pages that link to "Item:Q2232609"
From MaRDI portal
The following pages link to New complexity results for shop scheduling problems with agreement graphs (Q2232609):
Displaying 8 items.
- Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← 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)
- Some graph‐theoretical models for scheduling in automated production systems (Q4291473) (← links)
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)