This repository has been archived by the owner on Nov 17, 2023. It is now read-only.
forked from rte-france/or-tools
-
Notifications
You must be signed in to change notification settings - Fork 0
/
TaskSchedulingSat.cs
175 lines (147 loc) · 5.46 KB
/
TaskSchedulingSat.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
using System;
using System.Collections.Generic;
using Google.OrTools.Sat;
class Job {
public Job(List<Task> tasks) {
AlternativeTasks = tasks;
}
public Job Successor { get; set; }
public List<Task> AlternativeTasks { get; set; }
}
class Task {
public Task(string name, long duration, long equipment) {
Name = name;
Duration = duration;
Equipment = equipment;
}
public string Name {get; set;}
public long StartTime {get; set;}
public long EndTime {
get {
return StartTime + Duration;
}
}
public long Duration {get; set;}
public long Equipment { get; set; }
public override string ToString() {
return Name + " [ " + Equipment + " ]\tstarts: " + StartTime + " ends:" +
EndTime + ", duration: " + Duration;
}
}
class TaskSchedulingSat {
public static List<Job> myJobList = new List<Job>();
public static Dictionary<long, List<IntervalVar>> tasksToEquipment =
new Dictionary<long, List<IntervalVar>>();
public static Dictionary<string, long> taskIndexes =
new Dictionary<string, long>();
public static void InitTaskList() {
List<Task> taskList = new List<Task>();
taskList.Add(new Task("Job1Task0a", 15, 0));
taskList.Add(new Task("Job1Task0b", 25, 1));
taskList.Add(new Task("Job1Task0c", 10, 2));
myJobList.Add(new Job(taskList));
taskList = new List<Task>();
taskList.Add(new Task("Job1Task1a", 25, 0));
taskList.Add(new Task("Job1Task1b", 30, 1));
taskList.Add(new Task("Job1Task1c", 40, 2));
myJobList.Add(new Job(taskList));
taskList = new List<Task>();
taskList.Add(new Task("Job1Task2a", 20, 0));
taskList.Add(new Task("Job1Task2b", 35, 1));
taskList.Add(new Task("Job1Task2c", 10, 2));
myJobList.Add(new Job(taskList));
taskList = new List<Task>();
taskList.Add(new Task("Job2Task0a", 15, 0));
taskList.Add(new Task("Job2Task0b", 25, 1));
taskList.Add(new Task("Job2Task0c", 10, 2));
myJobList.Add(new Job(taskList));
taskList = new List<Task>();
taskList.Add(new Task("Job2Task1a", 25, 0));
taskList.Add(new Task("Job2Task1b", 30, 1));
taskList.Add(new Task("Job2Task1c", 40, 2));
myJobList.Add(new Job(taskList));
taskList = new List<Task>();
taskList.Add(new Task("Job2Task2a", 20, 0));
taskList.Add(new Task("Job2Task2b", 35, 1));
taskList.Add(new Task("Job2Task2c", 10, 2));
myJobList.Add(new Job(taskList));
taskList = new List<Task>();
taskList.Add(new Task("Job3Task0a", 10, 0));
taskList.Add(new Task("Job3Task0b", 15, 1));
taskList.Add(new Task("Job3Task0c", 50, 2));
myJobList.Add(new Job(taskList));
taskList = new List<Task>();
taskList.Add(new Task("Job3Task1a", 50, 0));
taskList.Add(new Task("Job3Task1b", 10, 1));
taskList.Add(new Task("Job3Task1c", 20, 2));
myJobList.Add(new Job(taskList));
taskList = new List<Task>();
taskList.Add(new Task("Job3Task2a", 65, 0));
taskList.Add(new Task("Job3Task2b", 5, 1));
taskList.Add(new Task("Job3Task2c", 15, 2));
myJobList.Add(new Job(taskList));
myJobList[0].Successor = myJobList[1];
myJobList[1].Successor = myJobList[2];
myJobList[2].Successor = null;
myJobList[3].Successor = myJobList[4];
myJobList[4].Successor = myJobList[5];
myJobList[5].Successor = null;
myJobList[6].Successor = myJobList[7];
myJobList[7].Successor = myJobList[8];
myJobList[8].Successor = null;
}
public static int GetTaskCount() {
int c = 0;
foreach (Job j in myJobList)
foreach (Task t in j.AlternativeTasks) {
taskIndexes[t.Name] = c;
c++;
}
return c;
}
public static int GetEndTaskCount() {
int c = 0;
foreach (Job j in myJobList)
if (j.Successor == null)
c += j.AlternativeTasks.Count;
return c;
}
static void Main() {
InitTaskList();
int taskCount = GetTaskCount();
CpModel model = new CpModel();
IntervalVar[] tasks = new IntervalVar[taskCount];
IntVar[] taskChoosed = new IntVar[taskCount];
IntVar[] allEnds = new IntVar[GetEndTaskCount()];
int endJobCounter = 0;
foreach (Job j in myJobList) {
IntVar[] tmp = new IntVar[j.AlternativeTasks.Count];
int i = 0;
foreach (Task t in j.AlternativeTasks) {
long ti = taskIndexes[t.Name];
taskChoosed[ti] = model.NewBoolVar(t.Name + "_choose");
tmp[i++] = taskChoosed[ti];
IntVar start = model.NewIntVar(0, 10000, t.Name + "_start");
IntVar end = model.NewIntVar(0, 10000, t.Name + "_end");
tasks[ti] = model.NewIntervalVar(start, t.Duration, end, t.Name + "_interval");
if (j.Successor == null)
allEnds[endJobCounter++] = end;
if (!tasksToEquipment.ContainsKey(t.Equipment))
tasksToEquipment[t.Equipment] = new List<IntervalVar>();
tasksToEquipment[t.Equipment].Add(tasks[ti]);
}
model.Add(LinearExpr.Sum(tmp) == 1);
}
foreach (KeyValuePair<long, List<IntervalVar>> pair in tasksToEquipment) {
model.AddNoOverlap(pair.Value);
}
IntVar makespan = model.NewIntVar(0, 100000, "makespan");
model.AddMaxEquality(makespan, allEnds);
model.Minimize(makespan);
// Create the solver.
CpSolver solver = new CpSolver();
// Solve the problem.
solver.Solve(model);
Console.WriteLine(solver.ResponseStats());
}
}