Class LinearEarlyTardyHeuristic
 All Implemented Interfaces:
Splittable<ConstructiveHeuristic<Permutation>>
,ConstructiveHeuristic<Permutation>
To define the LINET heuristic, first let he[j] be the weighted longest processing time heuristic of job j, defined as he[j] = we[j] / p[j], where we[j] is the earliness weight for job j, and p[j] is the processing time of job j. Next, let ht[j] be the weighted shortest processing time heuristic of job j, defined as ht[j] = wt[j] / p[j], where wt[j] is the tardiness weight of job j. Define the slack s[j] of job j as: s[j] = d[j]  T  p[j], where d[j] is the job's due date and T is the current time. Let k ≥ 1 be a lookahead parameter that can be tuned based on problem instance characteristics, and p̄ is the average processing time of remaining unscheduled jobs.
Now we can define the LINET heuristic, h[j] for job j, as follows. If s[j] ≤ 0, h[j] = ht[j]. Otherwise, if s[j] ≥ k*p̄, h[j] = he[j]. Otherwise, h[j] = ht[j]  s[j](ht[j]he[j])/(k*p̄). That is, for jobs with negative slack, the LINET heuristic is equivalent to weighted shortest processing time. For jobs with slack greater than some multiple of the average processing time, LINET is equivalent to weighted longest processing time. There is then a linear transition between the two extremes.
We make one additional adjustment to the heuristic as it was originally described. Since this
library's implementations of stochastic sampling algorithms assumes that constructive heuristics
always produce positive values, we must adjust the values produced by the LINET heuristic.
Specifically, we actually compute h'[j] = h[j] + shift, where shift = MIN_H
 min(we[j]
/ p[j]). The MIN_H
is a small nonzero value. In this way, we shift all of the h[j]
values by a constant amount such that all h[j] values are positive.

Field Summary

Constructor Summary
ConstructorDescriptionConstructs a LinearEarlyTardyHeuristic heuristic.LinearEarlyTardyHeuristic
(SingleMachineSchedulingProblem problem, double k) Constructs a LinearEarlyTardyHeuristic heuristic. 
Method Summary
Modifier and TypeMethodDescriptionfinal int
Gets the required length of complete solutions to the problem instance for which this constructive heuristic is configured.Creates an IncrementalEvaluation object corresponding to an initially empty Partial for use in incrementally constructing a solution to the problem for which this heuristic is designed.final Partial<Permutation>
createPartial
(int n) Creates an empty Partial solution, which will be incrementally transformed into a complete solution of a specified length.final Problem<Permutation>
Gets a reference to the instance of the optimization problem that is the subject of this heuristic.double
h
(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) Heuristically evaluates the possible addition of an element to the end of a Partial.Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface org.cicirello.search.ss.ConstructiveHeuristic
split

Field Details

MIN_H
public static final double MIN_HThe minimum heuristic value. If the heuristic value as calculated is lower than MIN_H, then MIN_H is used as the heuristic value. The reason is related to the primary purpose of the constructive heuristics in the library: heuristic guidance for stochastic sampling algorithms, which assume positive heuristic values (e.g., an h of 0 would be problematic). See Also:


Constructor Details

LinearEarlyTardyHeuristic
Constructs a LinearEarlyTardyHeuristic heuristic. Uses a default value of k=1. Parameters:
problem
 The instance of a scheduling problem that is the target of the heuristic.

LinearEarlyTardyHeuristic
Constructs a LinearEarlyTardyHeuristic heuristic. Parameters:
problem
 The instance of a scheduling problem that is the target of the heuristic.k
 A parameter of the heuristic (see class documentation). Must be at least 1. Throws:
IllegalArgumentException
 if k < 1.


Method Details

h
Description copied from interface:ConstructiveHeuristic
Heuristically evaluates the possible addition of an element to the end of a Partial. Higher evaluations imply that the element is a better choice for the next element to add. For example, if you evaluate two elements, x and y, with h, and h returns a higher value for y than for x, then this means that y is believed to be the better choice according to the heuristic. Implementations of this interface must ensure that h always returns a positive result. This is because stochastic sampling algorithms such as HBSS and VBSS assume that the constructive heuristic returns only positive values. Parameters:
p
 The current state of the Partialelement
 The element under consideration for adding to the PartialincEval
 An IncrementalEvaluation of p. This method assumes that incEval is of the same runtime type as the object returned byConstructiveHeuristic.createIncrementalEvaluation()
. Returns:
 The heuristic evaluation of the hypothetical addition of element to the end of p. The higher the evaluation, the more important the heuristic believes that element should be added next. The intention is to compare the value returned with the heuristic evaluations of other elements. Individual results in isolation are not necessarily meaningful.

createIncrementalEvaluation
Description copied from interface:ConstructiveHeuristic
Creates an IncrementalEvaluation object corresponding to an initially empty Partial for use in incrementally constructing a solution to the problem for which this heuristic is designed. The object returned incrementally computes any data associated with a Partial as needed by theConstructiveHeuristic.h(org.cicirello.search.ss.Partial<T>, int, org.cicirello.search.ss.IncrementalEvaluation<T>)
method. TheConstructiveHeuristic.h(org.cicirello.search.ss.Partial<T>, int, org.cicirello.search.ss.IncrementalEvaluation<T>)
method will assume that it will be given an object of the specific runtime type returned by this method. It is unsafe to pass IncrementalEvaluation objects created by one heuristic to theConstructiveHeuristic.h(org.cicirello.search.ss.Partial<T>, int, org.cicirello.search.ss.IncrementalEvaluation<T>)
method of another.The default implementation simply returns null, which is appropriate for heuristics that won't benefit from incrementally computing heuristic information.
 Returns:
 An IncrementalEvaluation for an empty Partial to be used for incrementally computing
any data required by the
ConstructiveHeuristic.h(org.cicirello.search.ss.Partial<T>, int, org.cicirello.search.ss.IncrementalEvaluation<T>)
method.

getProblem
Description copied from interface:ConstructiveHeuristic
Gets a reference to the instance of the optimization problem that is the subject of this heuristic. Specified by:
getProblem
in interfaceConstructiveHeuristic<Permutation>
 Returns:
 the instance of the optimization problem that is the subject of this heuristic.

createPartial
Description copied from interface:ConstructiveHeuristic
Creates an empty Partial solution, which will be incrementally transformed into a complete solution of a specified length. Specified by:
createPartial
in interfaceConstructiveHeuristic<Permutation>
 Parameters:
n
 the desired length of the final complete solution. Returns:
 an empty Partial solution

completeLength
public final int completeLength()Description copied from interface:ConstructiveHeuristic
Gets the required length of complete solutions to the problem instance for which this constructive heuristic is configured. Specified by:
completeLength
in interfaceConstructiveHeuristic<Permutation>
 Returns:
 length of solutions to the problem instance for which this heuristic is configured
