#region License Information
/* HeuristicLab
* Copyright (C) 2002-2012 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
namespace HeuristicLab.Problems.Instances {
///
/// Describes instances of the Capacitated Task Assignment Problem (CTAP).
///
public class CTAPData {
///
/// The name of the instance
///
public string Name { get; set; }
///
/// Optional! The description of the instance
///
public string Description { get; set; }
///
/// The number M of processors
///
public int Processors { get; set; }
///
/// The number N of tasks
///
public int Tasks { get; set; }
///
/// An MxN Matrix with M = |Processors| and N = |Tasks|
///
public double[,] ExecutionCosts { get; set; }
///
/// An NxN Matrix with N = |Tasks|
///
public double[,] CommunicationCosts { get; set; }
///
/// An array of length N with N = |Tasks|
///
public double[] MemoryRequirements { get; set; }
///
/// An array of length M with M = |Processors|
///
public double[] MemoryCapacities { get; set; }
///
/// Optional! An array of length N with N = |Tasks|
///
public int[] BestKnownAssignment { get; set; }
///
/// Optional! The quality value of the
///
public double? BestKnownQuality { get; set; }
}
}