this repo has no description
dekker.one
1include "disjunctive.mzn";
2
3int: jobs; % 作业的数量
4set of int: JOB = 1..jobs;
5int: tasks; % 每个作业的任务数量
6set of int: TASK = 1..tasks;
7array [JOB,TASK] of int: d; % 任务持续时间
8int: total = sum(i in JOB, j in TASK)(d[i,j]);% 总持续时间
9int: digs = ceil(log(10.0,total)); % 输出的数值
10array [JOB,TASK] of var 0..total: s; % 起始时间
11var 0..total: end; % 总结束时间
12
13constraint %% 保证任务按照顺序出现
14 forall(i in JOB) (
15 forall(j in 1..tasks-1)
16 (s[i,j] + d[i,j] <= s[i,j+1]) /\
17 s[i,tasks] + d[i,tasks] <= end
18 );
19
20constraint %% 保证任务之间没有重叠
21 forall(j in TASK) (
22 disjunctive([s[i,j] | i in JOB], [d[i,j] | i in JOB])
23 );
24
25solve minimize end;
26
27output ["end = \(end)\n"] ++
28 [ show_int(digs,s[i,j]) ++ " " ++
29 if j == tasks then "\n" else "" endif |
30 i in JOB, j in TASK ];