メインコンテンツへスキップ

Infeasible scheduling problem

進行中

コメント

2件のコメント

  • 正式なコメント
    Simranjit Kaur
    • Gurobi Staff
    This post is more than two years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum, or try Gurobot, our chatbot interface offering instant, expert-level support.
  • Ronald van der Velden
    • Gurobi Staff

    Consider replacing your constraints by:

    prob += sum_lines <= share_line[list(order_ids)[i],list(order_ids)[j]] + 1

    This will enforce that share_line becomes 1 when both orders in the (i,j) pair are scheduled on the same line.

    0

投稿コメントは受け付けていません。