Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2864_PermutationProblems/HeuristicLab.Problems.Instances/3.3/Types/JSSPData.cs @ 15541

Last change on this file since 15541 was 15541, checked in by fholzing, 7 years ago

#2864: CleanUp of old code, added LOP benchmark instances

File size: 2.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
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
23namespace HeuristicLab.Problems.Instances {
24  /// <summary>
25  /// Describes instances of the Job Shop Scheduling Problem (JSSP).
26  /// </summary>
27  public class JSSPData {
28    /// <summary>
29    /// The name of the instance
30    /// </summary>
31    public string Name { get; set; }
32    /// <summary>
33    /// Optional! The description of the instance
34    /// </summary>
35    public string Description { get; set; }
36
37    /// <summary>
38    /// The number of jobs.
39    /// </summary>
40    public int Jobs { get; set; }
41    /// <summary>
42    /// The number of resources.
43    /// </summary>
44    public int Resources { get; set; }
45    /// <summary>
46    /// The first dimension lists the jobs, the second dimension the operations and the value denotes the processing time.
47    /// </summary>
48    public double[,] ProcessingTimes { get; set; }
49    /// <summary>
50    /// The first dimension lists the jobs, the second dimension the operations and the value denotes the resource that is demanded.
51    /// </summary>
52    public int[,] Demands { get; set; }
53    /// <summary>
54    /// Optional! Specifies the due dates for each job.
55    /// </summary>
56    public double[] DueDates { get; set; }
57
58    /// <summary>
59    /// Optional! The best-known schedule.
60    /// The first dimension lists the resources, the second dimension is the order and the value denotes the job
61    /// </summary>
62    public int[,] BestKnownSchedule { get; set; }
63    /// <summary>
64    /// Optional! The quality of the best-known schedule.
65    /// </summary>
66    public double? BestKnownQuality { get; set; }
67  }
68}
Note: See TracBrowser for help on using the repository browser.