4 events
when toggle format what by license comment
Feb 5 '20 at 5:57 comment added A.Omidi As other community members mentioned too, one of the best ways to attack the real planning and scheduling problem is using heuristic methods. If you are interested in the programming language you could try writing your heuristic algorithm. AFAIK, some decomposition variants like branch-cut-price can solve the large scale scheduling problem and it's an exact method. But as I said, it needs some professional skills. I hope it would be useful. :)
Feb 5 '20 at 5:51 comment added A.Omidi State-of-art solvers like CPLEX or GUROBI can solve the scheduling models (MIPs) even in the large scale sense. Cplex has CPO engine which has been designed to solve the large scale models efficiently. Some open-source solvers like coin-CBC can solve large scale models if the problem formulation has been straight forward. To know what classes can be solved using MIPs, the best way is searching in articles or trying yourself. please, see this question.
Feb 5 '20 at 2:34 comment added Antarctica As far as I know, MIP solvers(especially open-source) are not too good to solve all kind of scheduling problem, some problems are harder than other. Am I right? If so, what is the class of problems that I can easily treat with MIP solvers ?. Another question : a decomposition method gives a bound on the problem, I believe that I need to apply a heuristic to find a feasible solution, Am I right ?
Feb 4 '20 at 9:40 history answered A.Omidi CC BY-SA 4.0