[6475] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[8603] | 3 | * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[6475] | 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 | using System.Text;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 26 |
|
---|
| 27 | namespace HeuristicLab.Encodings.ScheduleEncoding {
|
---|
| 28 | [Item("Job", "Represents a composition of tasks that require processing in a scheduling problem.")]
|
---|
| 29 | [StorableClass]
|
---|
| 30 | public class Job : Item {
|
---|
| 31 | [Storable]
|
---|
| 32 | public double DueDate { get; set; }
|
---|
| 33 | [Storable]
|
---|
| 34 | public int Index { get; set; }
|
---|
| 35 | [Storable]
|
---|
| 36 | public ItemList<Task> Tasks { get; set; }
|
---|
| 37 |
|
---|
| 38 | [StorableConstructor]
|
---|
| 39 | protected Job(bool deserializing) : base(deserializing) { }
|
---|
| 40 | protected Job(Job original, Cloner cloner)
|
---|
| 41 | : base(original, cloner) {
|
---|
| 42 | this.DueDate = original.DueDate;
|
---|
| 43 | this.Index = original.Index;
|
---|
| 44 | this.Tasks = cloner.Clone(original.Tasks);
|
---|
| 45 | }
|
---|
| 46 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 47 | return new Job(this, cloner);
|
---|
| 48 | }
|
---|
| 49 | public Job(int index, double dueDate)
|
---|
| 50 | : base() {
|
---|
| 51 | Index = index;
|
---|
| 52 | Tasks = new ItemList<Task>();
|
---|
| 53 |
|
---|
[7116] | 54 | DueDate = dueDate;
|
---|
[6475] | 55 |
|
---|
| 56 | }
|
---|
| 57 |
|
---|
| 58 | public override string ToString() {
|
---|
| 59 | StringBuilder sb = new StringBuilder();
|
---|
| 60 | sb.Append("Job#" + Index + " [ ");
|
---|
| 61 | foreach (Task t in Tasks) {
|
---|
| 62 | sb.Append(t.ToString() + " ");
|
---|
| 63 | }
|
---|
[7116] | 64 | sb.Append("{" + DueDate + "} ");
|
---|
[6475] | 65 | sb.Append("]");
|
---|
| 66 | return sb.ToString();
|
---|
| 67 | }
|
---|
| 68 |
|
---|
| 69 | internal Task GetPreviousTask(Task t) {
|
---|
| 70 | if (t.TaskNr == 0)
|
---|
| 71 | return null;
|
---|
| 72 | else
|
---|
| 73 | return Tasks[t.TaskNr - 1];
|
---|
| 74 | }
|
---|
| 75 |
|
---|
| 76 |
|
---|
| 77 | }
|
---|
| 78 | }
|
---|