Optimization

Answered

Comments

4 comments

  • Sonja Mars

    Hi,

    I am not sure I understand what you are exactly looking for. In general, you can use Gurobi to solve scheduling problems and Gurobi will then use a branch-and-bound algorithm to solve them. Maybe you find this webinar helpful. 

    If you can give us more details, this would be helpful to understand what you are looking for.

    Best regards,

      Sonja

    0
    Comment actions Permalink
  • marcillineous Anthonio

    for instance given an objective function and its constraints(14 of them) like seen below. how do i apply branch and bound or Johnson's rule  to find a solution using MIP. and since it's a scheduling problem how do i find the time the last area of interest was visited (because of this i am not sure Branch and bound is appropriate for this work) .Any ideas or advice is gladly appreciated and welcomed 

     

    0
    Comment actions Permalink
  • Sonja Mars

    First, you need to get that model into a programming language. Do you know Python? We provide a short introduction into modelling with Python. This might be helpful for you.

    Best regards,

    Sonja

    0
    Comment actions Permalink
  • marcillineous Anthonio

    i know some basic python but will do well to look at it thanks alot

    0
    Comment actions Permalink

Please sign in to leave a comment.

Powered by Zendesk