Changeset 15460 for branches/CFSAP/HeuristicLab.Problems.Scheduling.CFSAP/3.3/CFSAPSequenceOnly.cs

Timestamp:

11/08/17 07:34:46 (7 years ago)

Author:

abeham

Message:

#2747: worked on the CFSAP

• Added problem definition that defines both sequence and assignment for a single nest
• Added problem definition that would optimizes both sequence and assignment for multiple nests
• Added interface
• Added solving strategy that would use multiple instances of a template algorithm to optimize the worst nest
• Fixed bug in parser regarding setup times

File:

• branches/CFSAP/HeuristicLab.Problems.Scheduling.CFSAP/3.3/CFSAPSequenceOnly.cs (modified) (4 diffs)

branches/CFSAP/HeuristicLab.Problems.Scheduling.CFSAP/3.3/CFSAPSequenceOnly.cs

@@ -44 +44 @@
     }
 
+    public IntMatrix ProcessingTimes {
+      get { return ProcessingTimesParameter.Value; }
+      set { ProcessingTimesParameter.Value = value; }
+    }
+
     public IValueParameter<ItemList<IntMatrix>> SetupTimesParameter {
       get { return (IValueParameter<ItemList<IntMatrix>>)Parameters["SetupTimes"]; }
+    }
+
+    public ItemList<IntMatrix> SetupTimes {
+      get { return SetupTimesParameter.Value; }
+      set { SetupTimesParameter.Value = value; }
     }
 
@@ -162 +172 @@
       for (int machine = 0; machine < 2; machine++) {
         int[] assignment = Enumerable.Repeat(machine, N).ToArray();
-        int newT = EvaluateAssignement(order, assignment, processingTimes, setupTimes);
+        int newT = CFSAP.EvaluateAssignement(order, assignment, processingTimes, setupTimes);
         if (newT < T) { //New best solution has been found
           T = newT;
-          assignment.CopyTo(optimalAssignment, N);
+          optimalAssignment = assignment;
         }
-      }
-
-      return T;
-    }
-
-    //Function to evaluate individual with the specified assignment
-    public static int EvaluateAssignement(Permutation order, int[] assignment, IntMatrix processingTimes, ItemList<IntMatrix> setupTimes) {
-      var N = order.Length;
-      int T = 0;
-
-      for (int i = 0; i < N; i++) {
-        int operation = order[i];
-        int machine = assignment[operation];
-        T += processingTimes[machine, operation];
-      }
-
-      for (int machine = 0; machine < 2; machine++) {
-        int first = -1;
-        int last = -1;
-        for (int i = 0; i < N; i++) {
-          int operation = order[i];
-          if (assignment[operation] == machine) {
-            if (first == -1)
-              first = operation;
-            else
-              T += setupTimes[machine][last, operation];
-            last = operation;
-          }
-        }
-        if (last != -1 && first != -1)
-          T += setupTimes[machine][last, first];
       }
 
@@ -232 +211 @@
 
       return assignment;
+    }
+
+    public void UpdateEncoding() {
+      Encoding.Length = ProcessingTimes.Columns;
     }
 
@@ -265 +248 @@
       }
       SetupTimesParameter.Value = setups;
-      Encoding.Length = data.Jobs;
+      UpdateEncoding();
       Name = data.Name + "-nest" + nest;
       Description = data.Description;
+      if (data.BestKnownCycleTime.HasValue)
+        BestKnownQuality = data.BestKnownCycleTime.Value;
+      else BestKnownQualityParameter.Value = null;
     }
   }