Pages that link to "Item:Q2333794"
From MaRDI portal
The following pages link to Two-machine open shop problem with agreement graph (Q2333794):
Displaying 3 items.
- 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 genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)
