
jasima.shopSim.prioRules.basic.TieBreakerFASFS Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of jasima-main Show documentation
Show all versions of jasima-main Show documentation
JAva SImulatior for MAnufacturing and logistics - A framework for discrete event simulation and computer experiments with a main focus on modelling and analyzing logistic/manufacturing systems.
/*******************************************************************************
* Copyright (c) 2010-2013 Torsten Hildebrandt and jasima contributors
*
* This file is part of jasima, v1.0.
*
* jasima 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.
*
* jasima 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 jasima. If not, see .
*
* $Id: TieBreakerFASFS.java 74 2013-01-08 17:31:49Z [email protected] $
*******************************************************************************/
package jasima.shopSim.prioRules.basic;
import jasima.shopSim.core.PR;
import jasima.shopSim.core.PrioRuleTarget;
/**
* This class implements a rule that sequences job in increasing order of their
* job number. As this attribute strongly correlates to the time of arrival, the
* rule operates similarly to {@link FASFS}. However, there are subtle
* differences between the two implementations. With the FASFS rule, jobs can
* have equal priorities if they arrived at exactly the same instant. Therefore,
* this rule is preferred as a final tie-breaker as it ensures a deterministic
* order.
*
* @author Torsten Hildebrandt
* @see FASFS
* @version "$Id: TieBreakerFASFS.java 74 2013-01-08 17:31:49Z [email protected] $"
*/
public class TieBreakerFASFS extends PR {
@Override
public double calcPrio(PrioRuleTarget j) {
// all future jobs have lower priority than regular ones
if (j.isFuture())
return -j.getJobNum();
else
return 1.0 / (j.getJobNum() + 1);
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy