#region License Information
/* HeuristicLab
* Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
using System;
using System.Collections.Generic;
using System.Text;
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Data;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
namespace HeuristicLab.Encodings.ScheduleEncoding {
[Item("Schedule", "Represents the general solution for scheduling problems.")]
[StorableClass]
public class Schedule : NamedItem, IScheduleEncoding {
#region Properties
[Storable]
private ItemList resources;
public ItemList Resources {
get { return resources; }
set {
if (resources != null) DeregisterResourcesEvents();
resources = value;
if (resources != null) RegisterResourcesEvents();
OnResourcesChanged();
}
}
[Storable]
private DoubleValue quality;
public DoubleValue Quality {
get { return quality; }
set {
if (quality != value) {
if (quality != null) DeregisterQualityEvents();
quality = value;
if (quality != null) RegisterQualityEvents();
OnQualityChanged();
}
}
}
[Storable]
private Dictionary lastScheduledTaskOfJob;
#endregion
[StorableConstructor]
protected Schedule(bool deserializing) : base(deserializing) { }
protected Schedule(Schedule original, Cloner cloner)
: base(original, cloner) {
this.Resources = cloner.Clone(original.Resources);
this.Quality = cloner.Clone(original.Quality);
this.lastScheduledTaskOfJob = new Dictionary(original.lastScheduledTaskOfJob);
}
public Schedule(int nrOfResources) {
Resources = new ItemList();
for (int i = 0; i < nrOfResources; i++) {
Resources.Add(new Resource(i));
}
lastScheduledTaskOfJob = new Dictionary();
}
public override IDeepCloneable Clone(Cloner cloner) {
return new Schedule(this, cloner);
}
#region Events
public event EventHandler QualityChanged;
private void OnQualityChanged() {
var changed = QualityChanged;
if (changed != null)
changed(this, EventArgs.Empty);
}
private void RegisterQualityEvents() {
Quality.ValueChanged += new EventHandler(Quality_ValueChanged);
}
private void DeregisterQualityEvents() {
Quality.ValueChanged -= new EventHandler(Quality_ValueChanged);
}
private void Quality_ValueChanged(object sender, EventArgs e) {
OnQualityChanged();
}
public event EventHandler ResourcesChanged;
private void OnResourcesChanged() {
var changed = ResourcesChanged;
if (changed != null)
changed(this, EventArgs.Empty);
}
private void RegisterResourcesEvents() {
Resources.PropertyChanged += new System.ComponentModel.PropertyChangedEventHandler(Resources_PropertyChanged);
}
private void DeregisterResourcesEvents() {
Resources.PropertyChanged -= new System.ComponentModel.PropertyChangedEventHandler(Resources_PropertyChanged);
}
private void Resources_PropertyChanged(object sender, EventArgs e) {
OnResourcesChanged();
}
#endregion
public void ScheduleTask(int resNr, double startTime, double duration, int jobNr) {
ScheduledTask task = new ScheduledTask(resNr, startTime, duration, jobNr);
Resource affectedResource = resources[task.ResourceNr];
int i = 0;
while (i < affectedResource.Tasks.Count && affectedResource.Tasks[i].StartTime < task.StartTime)
i++;
if (!lastScheduledTaskOfJob.ContainsKey(jobNr)) {
lastScheduledTaskOfJob.Add(jobNr, task);
task.TaskNr = 0;
} else {
task.TaskNr = lastScheduledTaskOfJob[jobNr].TaskNr + 1;
lastScheduledTaskOfJob[jobNr] = task;
}
if (i >= affectedResource.Tasks.Count)
affectedResource.Tasks.Add(task);
else
affectedResource.Tasks.Insert(i, task);
}
public ScheduledTask GetLastScheduledTaskForJobNr(int jobNr) {
if (lastScheduledTaskOfJob.ContainsKey(jobNr))
return lastScheduledTaskOfJob[jobNr];
else
return null;
}
public override string ToString() {
StringBuilder sb = new StringBuilder();
sb.Append("[ ");
foreach (Resource r in Resources) {
sb.Append(r.ToString() + " \n");
}
sb.Append("]");
return sb.ToString();
}
public double CalculateMakespan() {
double quality = 0;
foreach (Resource r in Resources) {
if (r.TotalDuration > quality) {
quality = r.TotalDuration;
}
}
return quality;
}
public override bool Equals(object obj) {
if (obj.GetType() == typeof(Schedule))
return AreEqual(this, obj as Schedule);
else
return false;
}
public override int GetHashCode() {
if (Resources.Count == 1)
return Resources[0].GetHashCode();
if (Resources.Count == 2)
return Resources[0].GetHashCode() ^ Resources[1].GetHashCode();
return 0;
}
private static bool AreEqual(Schedule schedule1, Schedule schedule2) {
if (schedule1.Resources.Count != schedule2.Resources.Count)
return false;
for (int i = 0; i < schedule1.Resources.Count; i++) {
if (!schedule1.Resources[i].Equals(schedule2.Resources[i]))
return false;
}
return true;
}
}
}