Package hu.u_szeged.nbo.res_alloc.model.type

Examples of hu.u_szeged.nbo.res_alloc.model.type.Shift

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
    HashMap<Task, Vector<Shift>> ID = new HashMap<Task, Vector<Shift>>();
    HashMap<Task, Integer> l = new HashMap<Task, Integer>();
    HashMap<Task, Integer> k = new HashMap<Task, Integer>();
    while (!M.isEmpty()) {
      // 1st step
      Shift efs = getefs();    // Earliest free shift
      if (efs == null) {
        log += (new Date()).toString() + ": nincs tobb szabad eroforras\n";
        return;
      }
      // 2nd step
      Vector<Task> L = loadL(M, efs, l, k);
      if (L.isEmpty()) {
        log += (new Date()).toString() + ": nincs kompartibilis munka\n";
        efs.setNotUsable(true);
        continue;
      }
      else
      {
        log += (new Date()).toString() + ": L feltoltve, elemszam: " + L.size() + "\n";
      }
    // step 3
      sortLAndID(efs, ID, L, l, k);
      if (L.isEmpty()) {
        log += (new Date()).toString() + ": nincs elvegezheto munka\n";
        efs.setNotUsable(true);
        continue;
      }
    // step 4
      Task cTask = minimizeL(L, ID, l);  // Chosen task
      log += (new Date()).toString() + ": " + cTask.getId() + ". munka beutemezese\n";
View Full Code Here
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
    model.NormalizeOutputs();
  }
 
  /** for step 1 */
  private Shift getefs() {
    Shift efs = null;
    int tau = Integer.MAX_VALUE;
   
    for (int i = 1; i <= model.getShiftContainer().getShiftNum(); i++) {
      Shift iShift = model.getShiftContainer().getShiftById(i);
      if (iShift.isNotUsable() == false && iShift.getDisengagingTime() < tau) {
        tau = iShift.getDisengagingTime();
        efs = iShift;
      }
    }
    return efs;
  }
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
        ID.put(task, v);
      }
      if (ig > 1) {
        Vector<Shift> shiftVector = new Vector<Shift>();
        for (int j = 1; j <= model.getShiftContainer().getShiftNum(); j++) {
          Shift s = model.getShiftContainer().getShiftById(j);
          int a = k.get(task);
          int b = s.getDisengagingTime() + traffic.getDistance(s.getActualPlace(), task.getPlace(),
              s.getDisengagingTime());
          int c = l.get(task) + traffic.getDistance(task.getPlace(), s.getEndPlace(), l.get(task));
          int d = s.getTime().getEnd() + s.getOvertime();
          if (s.isNotUsable() == false && a >= b && c <= d) {
            shiftVector.add(s);
          }
        }
        if (shiftVector.size() < task.getResourceDemandNum())
        {
View Full Code Here
157
158
159
160
161
162
163
164
165
166
167
168
169
  private void minShiftVector(Vector<Shift> v, Task t, int l) {
    while (v.size() > t.getResourceDemandNum()) {
      int maxIndex = -1;
      int max = Integer.MIN_VALUE;
      for (int i = 0; i < v.size(); i++) {
        Shift s = v.get(i);
        int x = traffic.getDistance(s.getActualPlace(), t.getPlace(), s.getDisengagingTime())
          + traffic.getDistance(t.getPlace(), s.getEndPlace(), l);
        if (x > max) {
          max = x;
          maxIndex = i;
        }
      }
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
  }
 
  private int computeC_U() {
    int C_U = 0;
    for (int i = 1; i <= shiftContainer.getShiftNum(); i++) {
      Shift s = shiftContainer.getShiftById(i);
      if (s.getParent() == null) {
        Place actualPlace = s.getBeginPlace();
        int actualTime = s.getTime().getBegin();
        for (int j = 0; j < s.getAssignedTasks().size(); j++) {
          Task t = s.getAssignedTasks().get(j);
          int traveltime = trafficProperties.getDistance(actualPlace,
              t.getPlace(), actualTime);
          C_U += s.getResource().getFare() * traveltime;
          actualPlace = t.getPlace();
          actualTime = t.getCompletionTime().getEnd();
        }
        C_U += s.getResource().getFare() *
          trafficProperties.getDistance(actualPlace, s.getEndPlace(),
              actualTime);
      }
    }
    return C_U;
  }
View Full Code Here
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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
  }

  private int computeC_A() {
    int C_A = 0;
    for (int i = 1; i <= shiftContainer.getShiftNum(); i++) {
      Shift s = shiftContainer.getShiftById(i);
      if (s.getParent() == null) {
        Place actualPlace = s.getBeginPlace();
        int actualTime = s.getTime().getBegin();
        int worktime = 0;
        for (int j = 0; j < s.getAssignedTasks().size(); j++) {
          Task t = s.getAssignedTasks().get(j);
          int time = t.getCompletionTime().getEnd() -
              t.getCompletionTime().getBegin()
          + trafficProperties.getDistance(actualPlace, t.getPlace(), actualTime);
          worktime += time;
          actualTime = t.getCompletionTime().getEnd();
          actualPlace = t.getPlace();
        }
        worktime += trafficProperties.getDistance(actualPlace, s.getEndPlace(), actualTime);
       
        int time;
        if (s.getAssignedTasks().isEmpty()) {
          time = s.getTime().getEnd() - s.getTime().getBegin();
        }
        else {
          Task t = s.getAssignedTasks().lastElement();
          int max1 = t.getCompletionTime().getEnd() + trafficProperties.getDistance(t.getPlace(),
              s.getEndPlace(), t.getCompletionTime().getEnd());
          int max2 = s.getTime().getEnd();
          int max = (max1 > max2) ? max1 : max2;
          time = max - s.getTime().getBegin();
        }
        if (time < worktime) {
//          System.out.println(s + "\ntime: " + time + "\nworktime: " + worktime + "\n");
        }
        C_A += (time - worktime) * s.getStandCost();
       
      }
    }
//    System.out.println("miva");
//    System.out.println(C_A);
 
View Full Code Here
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
  }
 
  private int computeC_T() {
    int C_T = 0;
    for (int i = 1; i <= shiftContainer.getShiftNum(); i++) {
      Shift s = shiftContainer.getShiftById(i);
      if (s.getParent() == null && !s.getAssignedTasks().isEmpty()) {
        Task lastTask = s.getAssignedTasks().lastElement();
        int overtime = lastTask.getCompletionTime().getEnd() - s.getTime().getEnd();
        if (overtime > 0) {
          C_T += overtime * s.getOvertimeCost();
        }
      }
    }
    return C_T;
  }
View Full Code Here
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
  }
 
  public void NormalizeOutputs() {
    int i;
    for (i = 1; i <= this.getShiftContainer().getShiftNum(); i++) {
      Shift s = this.getShiftContainer().getShiftById(i);
      if (s.getParent() == null) {
        s.sortAssignments();
      }
    }

    for (i = this.getShiftContainer().getShiftNum(); i > 0; i--) {
      Shift s = this.getShiftContainer().getShiftById(i);
      if (s.getParent() != null) {
        this.getShiftContainer().removeShiftById(i);
      }
    }

    // matching ResourceDemands with Shifts
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
 
  /** for step 2 */
  private Vector<Shift> loadLM(Task cTask) {
    Vector<Shift> LM = new Vector<Shift>();
    for (int i = 1; i <= model.getShiftContainer().getShiftNum(); i++) {
      Shift s = model.getShiftContainer().getShiftById(i);
      if (s.isNotUsable() == false) {
        int max1 = s.getDisengagingTime() +
          traffic.getDistance(s.getActualPlace(), cTask.getPlace(),
          s.getDisengagingTime());
        int max2 = cTask.getPrefferedTimeInterval().getBegin();
        lj = ((max1 > max2) ? max1 : max2) + cTask.getNormTime();
        if (lj + traffic.getDistance(cTask.getPlace(), s.getEndPlace(), lj)
          <= s.getTime().getEnd() + s.getOvertime()) {
          LM.add(s);
        }
      }
    }
    return LM;   
View Full Code Here
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
   
    int scount[] = new int[11];
    int sotime[] = new int[11];
   
    for (int i = 1; i <= shiftContainer.getShiftNum(); i++) {
      Shift s = shiftContainer.getShiftById(i);
      if (s.getParent() == null) {
        out += "E" + s.getId() + " (" + s.getBeginPlace().getName() + "):\n";
       
        int shiftActiveTime = 0;
        int shiftActualTime = s.getTime().getBegin();
        Place shiftActualPlace = s.getBeginPlace();
        int shiftOverTime = 0;
        for (int j = 0; j < s.getAssignedTasks().size(); j++) {
          Task t = s.getAssignedTasks().get(j);

          if (shiftActualPlace.getId() != t.getPlace().getId()) {
            int traveltime = trafficProperties.getDistance(shiftActualPlace,
                t.getPlace(), shiftActualTime);
            int cost = s.getResource().getFare() * traveltime;
               
            numOfTravels++;
            totalCostOfTravels += cost;
            out += "    utazas: " + t.getPlace().getName() +
                " (ktg:" + cost + ")\n";
            shiftActualPlace = t.getPlace();
            shiftActualTime += traveltime;
            shiftActiveTime += traveltime;
          }
          shiftActiveTime += t.getCompletionTime().getEnd() - t.getCompletionTime().getBegin();
          shiftActualTime = t.getCompletionTime().getEnd();
          out += "  M" + t.getId() + "\t[" + t.getCompletionTime().getBegin()
              + "-" + t.getCompletionTime().getEnd() + "] ";
          out += "(kes ktg: " + KES(t) + ")\n";
         
          int tohome = trafficProperties.getDistance(t.getPlace(),
              s.getEndPlace(), t.getCompletionTime().getEnd());
          if (t.getCompletionTime().getEnd() + tohome > s.getTime().getEnd()) {
            int ot = t.getCompletionTime().getEnd() + tohome -
                s.getTime().getEnd();
            if (ot > shiftOverTime) {
              shiftOverTime = ot;
            }
          }
        }
        //shiftActualTime += shiftOverTime;
        if (shiftActualPlace.getId() != s.getEndPlace().getId()) {
          int traveltime = trafficProperties.getDistance(shiftActualPlace,
              s.getEndPlace(),
              shiftActualTime);
          int cost = s.getResource().getFare() * traveltime;
             
          numOfTravels++;
          totalCostOfTravels += cost;
          out += "    utazas: " + s.getEndPlace().getName() +
              " (ktg:" + cost + ")\n";
          shiftActiveTime += traveltime;
        }
        int time = s.getTime().getEnd() - s.getTime().getBegin() + shiftOverTime;
        int rate = ((int)((double)shiftActiveTime/(double)time*100));
        out += "  kihasznaltsag: " + rate +
            "% (" + shiftActiveTime + "/" + time + ")\n";
        out += "  tulora ktg: " + (shiftOverTime * s.getOvertimeCost()) + "\n";
        int standcost = (time - shiftActiveTime) * s.getStandCost();
        out += "  varakozasi ktg: " + standcost + "\n";
       
       
        shiftTotalActiveTime += shiftActiveTime;
        shiftTotalTime += time;
View Full Code Here
TOP

Related Classes of hu.u_szeged.nbo.res_alloc.model.type.Shift

  • hu.u_szeged.nbo.res_alloc.algorithm.GreedyAlgorithm
  • hu.u_szeged.nbo.res_alloc.algorithm.GreedyAlgorithm1
  • hu.u_szeged.nbo.res_alloc.algorithm.GreedyAlgorithm2
  • hu.u_szeged.nbo.res_alloc.algorithm.GreedyAlgorithm3
  • hu.u_szeged.nbo.res_alloc.model.ResAllocModel
  • hu.u_szeged.nbo.res_alloc.model.ResAllocModelLoader
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.