[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2008 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 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Text;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
| 27 | using System.Collections;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Scheduling.JSSP {
|
---|
| 30 | public class OperationUpdater : OperatorBase {
|
---|
| 31 | public override string Description {
|
---|
| 32 | get { return @"TODO\r\nOperator description still missing ..."; }
|
---|
| 33 | }
|
---|
| 34 |
|
---|
| 35 | public OperationUpdater()
|
---|
| 36 | : base() {
|
---|
| 37 | AddVariableInfo(new VariableInfo("Operation", "Scheduled operation and unscheduled operation which shall be updated.", typeof(Operation), VariableKind.In | VariableKind.Out));
|
---|
| 38 | }
|
---|
| 39 |
|
---|
| 40 | public override IOperation Apply(IScope scope) {
|
---|
| 41 | Operation scheduledOp = GetVariableValue<Operation>("Operation", scope, false);
|
---|
| 42 | for(int i = 0; i < scope.SubScopes.Count; i++) {
|
---|
| 43 | Operation op = GetVariableValue<Operation>("Operation", scope.SubScopes[i], false);
|
---|
| 44 | if((op.Job == scheduledOp.Job) && (op.Predecessors != null)) {
|
---|
| 45 | int index = -1;
|
---|
| 46 | for(int j = 0; j < op.Predecessors.Count; j++) {
|
---|
| 47 | if(((IntData)op.Predecessors[j]).Data == scheduledOp.OperationIndex) {
|
---|
| 48 | index = j;
|
---|
| 49 | }
|
---|
| 50 | }
|
---|
| 51 | if(index != -1) {
|
---|
| 52 | op.Predecessors.RemoveAt(index); // remove scheduled op from predecessor list
|
---|
| 53 | op.Start = scheduledOp.Start + scheduledOp.Duration; // new earliest start date
|
---|
| 54 | return null;
|
---|
| 55 | }
|
---|
| 56 | }
|
---|
| 57 | }
|
---|
| 58 | return null;
|
---|
| 59 | }
|
---|
| 60 | }
|
---|
| 61 | }
|
---|