Package jline.api.sn

Class SnPatienceHandles

java.lang.Object

jline.api.sn.SnPatienceHandles

public final class SnPatienceHandles
extends Object

Patience (time-to-abandon) handles derived from a NetworkStruct.

The abandonment solvers need the patience law as FUNCTIONS -- a complementary cdf and a hazard rate -- not as moments, because that is what the underlying theory consumes: Whitt's engineering solution reads the hazard near the origin, and the fluid models integrate the ccdf. LINE stores the law as a MAP/PH pair in sn.impatienceProc, from which both are available in closed form.

Java twin of matlab/src/api/sn/sn_patience_handles.m and python/line_solver/api/sn/patience.py.

Since:

LINE 3.1.0

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static final class	SnPatienceHandles.Handles	The patience law of one station-class pair, in the forms the solvers consume.

Method Summary

Modifier and Type	Method	Description
static String	expRefusal(NetworkStruct sn)	expRefusal(NetworkStruct, int, int) over every station-class pair.
static String	expRefusal(NetworkStruct sn, int ist, int r)	The by-name refusal of a reneging patience that is not EXPONENTIAL at station ist, class r, or "" when there is none.
static String	refusal(NetworkStruct sn)	refusal(NetworkStruct, int, int) over every station-class pair.
static String	refusal(NetworkStruct sn, int ist, int r)	The by-name refusal of a reneging patience that is not a Markovian law at station ist, class r, or "" when there is none.
static SnPatienceHandles.Handles	snPatienceHandles(NetworkStruct sn, int ist, int r)	Build the patience handles of station ist, class r.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Details

refusal

public static String refusal(NetworkStruct sn,
 int ist,
 int r)

The by-name refusal of a reneging patience that is not a Markovian law at station ist, class r, or "" when there is none. The analytical solvers read the patience through its (D0,D1) pair, which the struct carries for a Markovian law only; a Det, Gamma, Lognormal, Pareto, Uniform or Weibull patience is REFUSED, never replaced by an exponential of the same mean. SolverMAM, SolverMVA and SolverFluid raise this sentence in the gate and in the run. Twin of MATLAB sn_patience_refusal.m.

Parameters:

sn - the network struct

ist - station index

r - class index

Returns:

the refusal sentence, or ""

refusal

public static String refusal(NetworkStruct sn)

refusal(NetworkStruct, int, int) over every station-class pair.

Parameters:

sn - the network struct

Returns:

the first refusal sentence, or ""

expRefusal

public static String expRefusal(NetworkStruct sn,
 int ist,
 int r)

The by-name refusal of a reneging patience that is not EXPONENTIAL at station ist, class r, or "" when there is none. The stricter twin of refusal(NetworkStruct, int, int), worded in the same shape, for the analyses that read the patience as one memoryless rate: SolverCTMC and SolverSSA, whose RENEGE event keeps no patience phase per waiting job, and SolverMVA method 'erlanga', the M/M/s/r+M chain. Callers append their own redirect. Twin of MATLAB sn_patience_exp_refusal.m.

Parameters:

sn - the network struct

ist - station index

r - class index

Returns:

the refusal sentence, or ""

expRefusal

public static String expRefusal(NetworkStruct sn)

expRefusal(NetworkStruct, int, int) over every station-class pair.

Parameters:

sn - the network struct

Returns:

the first refusal sentence, or ""

snPatienceHandles

public static SnPatienceHandles.Handles snPatienceHandles(NetworkStruct sn,
 int ist,
 int r)

Build the patience handles of station ist, class r.

Parameters:

sn - the network struct

ist - station index

r - class index

Returns:

the handles, or null when the station-class pair has no Markovian reneging patience (a non-Markovian one is named by refusal(NetworkStruct, int, int))