All Downloads are FREE. Search and download functionalities are using the official Maven repository.

jasima.shopSim.prioRules.gp.Warwick1 Maven / Gradle / Ivy

Go to download

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.

There is a newer version: 1.3.0
Show newest version
/*******************************************************************************
 * 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: Warwick1.java 73 2013-01-08 17:16:19Z [email protected] $
 *******************************************************************************/
package jasima.shopSim.prioRules.gp;

import jasima.shopSim.core.PrioRuleTarget;
import jasima.shopSim.prioRules.upDownStream.PTPlusWINQPlusNPT;

/**
 * 
 * @author Torsten Hildebrandt 
 * @version $Id: Warwick1.java 73 2013-01-08 17:16:19Z [email protected] $
 */
public class Warwick1 extends GPRuleBase {

	@Override
	public double calcPrio(PrioRuleTarget j) {
		double p = j.getCurrentOperation().procTime;
		double winq = jasima.shopSim.prioRules.upDownStream.WINQ.winq(j);
		double winq2 = jasima.shopSim.prioRules.upDownStream.XWINQ.xwinq(j);
		double tiq = j.getShop().simTime() - j.getArriveTime();
		double npt = PTPlusWINQPlusNPT.npt(j);
		double rpt = j.remainingProcTime();

		return div(
				div(ifte(
						div(tiq, p),
						div(tiq,
								add(max(mul(p, p), add(1, div(tiq, p))),
										mul(winq2, npt))), div(tiq, p)),
						max(tiq,
								div(ifte(
										add(max(mul(winq2, npt), sub(winq, rpt)),
												winq),
										div(max(add(1, winq), max(0, tiq)),
												add(mul(p, p), winq)),
										div(tiq, p)), add(1, 1)))), p);
	}

}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy