skimono

Week_4_Task_1

Mar 9th, 2026
27
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.78 KB | None | 0 0
  1. /*array[1..5, 1..3] of var 0..1: assignment;
  2. constraint forall(i in 1..5)(sum(j in 1..3)(assignment[i,j]) = 1);
  3. constraint forall(j in 1..3)(sum(i in 1..5)(assignment[i,j]) <= 2);
  4. solve minimize sum(i in 1..5, j in 1..3)(cost[i,j] * assignment[i,j]);*/
  5. int: cnt_workers = 5;
  6. int: cnt_tasks = 3;
  7.  
  8. set of int: workers = 1..cnt_workers;
  9. set of int: tasks = 1..cnt_tasks;
  10.  
  11. array[workers, tasks] of int: cost;
  12. array[workers, tasks] of var 0..1: as;
  13. array[tasks] of var 0..2: w_on_t;
  14.  
  15. constraint forall(w in workers)(
  16. sum(t in tasks)(as[w, t]) = 1
  17. );
  18.  
  19. constraint forall(t in tasks)(
  20. w_on_t[t] = sum(w in workers)(as[w, t])
  21. );
  22.  
  23. constraint forall(t in tasks)(
  24. w_on_t[t] <= 2
  25. );
  26.  
  27. var int: ans = sum(w in workers, t in tasks)(cost[w, t] * as[w, t]);
  28.  
  29. solve minimize ans;
Advertisement
Add Comment
Please, Sign In to add comment