#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
namespace HeuristicLab.Problems.Instances {
///
/// Describes instances of the Job Shop Scheduling Problem (JSSP).
///
public class JSSPData {
///
/// The name of the instance
///
public string Name { get; set; }
///
/// Optional! The description of the instance
///
public string Description { get; set; }
///
/// The number of jobs.
///
public int Jobs { get; set; }
///
/// The number of resources.
///
public int Resources { get; set; }
///
/// The first dimension lists the jobs, the second dimension the operations and the value denotes the processing time.
///
public double[,] ProcessingTimes { get; set; }
///
/// The first dimension lists the jobs, the second dimension the operations and the value denotes the resource that is demanded.
///
public int[,] Demands { get; set; }
///
/// Optional! Specifies the due dates for each job.
///
public double[] DueDates { get; set; }
///
/// Optional! The best-known schedule.
/// The first dimension lists the resources, the second dimension is the order and the value denotes the job
///
public int[,] BestKnownSchedule { get; set; }
///
/// Optional! The quality of the best-known schedule.
///
public double? BestKnownQuality { get; set; }
}
}