[7548] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17180] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[7548] | 4 | *
|
---|
| 5 | * This file is part of HeuristicLab.
|
---|
| 6 | *
|
---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
| 8 | * it under the terms of the GNU General Public License as published by
|
---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
| 10 | * (at your option) any later version.
|
---|
| 11 | *
|
---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 15 | * GNU General Public License for more details.
|
---|
| 16 | *
|
---|
| 17 | * You should have received a copy of the GNU General Public License
|
---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 19 | */
|
---|
| 20 | #endregion
|
---|
| 21 |
|
---|
| 22 | namespace HeuristicLab.Problems.Instances {
|
---|
| 23 | /// <summary>
|
---|
| 24 | /// Describes instances of the Capacitated Task Assignment Problem (CTAP).
|
---|
| 25 | /// </summary>
|
---|
| 26 | public class CTAPData {
|
---|
| 27 | /// <summary>
|
---|
| 28 | /// The name of the instance
|
---|
| 29 | /// </summary>
|
---|
| 30 | public string Name { get; set; }
|
---|
| 31 | /// <summary>
|
---|
| 32 | /// Optional! The description of the instance
|
---|
| 33 | /// </summary>
|
---|
| 34 | public string Description { get; set; }
|
---|
| 35 |
|
---|
| 36 | /// <summary>
|
---|
| 37 | /// The number M of processors
|
---|
| 38 | /// </summary>
|
---|
| 39 | public int Processors { get; set; }
|
---|
| 40 | /// <summary>
|
---|
| 41 | /// The number N of tasks
|
---|
| 42 | /// </summary>
|
---|
| 43 | public int Tasks { get; set; }
|
---|
| 44 | /// <summary>
|
---|
| 45 | /// An MxN Matrix with M = |Processors| and N = |Tasks|
|
---|
| 46 | /// </summary>
|
---|
| 47 | public double[,] ExecutionCosts { get; set; }
|
---|
| 48 | /// <summary>
|
---|
| 49 | /// An NxN Matrix with N = |Tasks|
|
---|
| 50 | /// </summary>
|
---|
| 51 | public double[,] CommunicationCosts { get; set; }
|
---|
| 52 | /// <summary>
|
---|
| 53 | /// An array of length N with N = |Tasks|
|
---|
| 54 | /// </summary>
|
---|
| 55 | public double[] MemoryRequirements { get; set; }
|
---|
| 56 | /// <summary>
|
---|
| 57 | /// An array of length M with M = |Processors|
|
---|
| 58 | /// </summary>
|
---|
| 59 | public double[] MemoryCapacities { get; set; }
|
---|
| 60 |
|
---|
| 61 | /// <summary>
|
---|
| 62 | /// Optional! An array of length N with N = |Tasks|
|
---|
| 63 | /// </summary>
|
---|
| 64 | public int[] BestKnownAssignment { get; set; }
|
---|
| 65 | /// <summary>
|
---|
| 66 | /// Optional! The quality value of the <see cref="BestKnownAssignment"/>
|
---|
| 67 | /// </summary>
|
---|
| 68 | public double? BestKnownQuality { get; set; }
|
---|
| 69 | }
|
---|
| 70 | }
|
---|