Schedule Optimization Problem trying to present the solution in a better way – Python / Gekko
So my music school runs a festival for all student bands to play together. Since there are some family members across diferent bands, I’m trying to create a solution to optimize the schedule of the bands – trying to minimize sum of time between bands that have relatives. Now I think I’ve found a solution. Don’t know if it’s the best but it looks like it’s working. Now I’m trying to find a better way to present the solution.
Schedule Optimization Problem don’t know a better way to present the solution – Python / Gekko
So my music school runs a festival for all student bands to play together.
Since there are some family members across diferent bands, I’m trying to create a solution to optimize the schedule of the bands – trying to minimize sum of time between bands that have relatives. Now I think I’ve found a solution. Don’t know if it’s the best but it looks like it’s working. Now I’m trying to find a better way to present the solution. This “x” matrix is huge and maybe it would be better to extract only the “1”s and make a schedule table with the slots and what band is in a cronological order. But I don’t know where to start. Hoping someone can point the direction.
Schedule Optimization Problem not feasible and don’t know why – Python / Gekko
So my school of music runs a festival for all student bands to play together.
Since there are some family members across diferent bands, I’m trying to create a solution to optimize the schedule of the bands – trying to minimize sum of time between bands that have relatives. Now I don’t know why the problem is showing as not feasible (don’t know if is something with the degree of freedon or some syntax mistake…)