Uses of Interface
org.cicirello.search.problems.scheduling.SingleMachineSchedulingProblemData
Packages that use SingleMachineSchedulingProblemData
Package
Description
Package of classes and interfaces related to representing and solving scheduling problems, which
includes implementations of constructive heuristics for scheduling problems.
-
Uses of SingleMachineSchedulingProblemData in org.cicirello.search.problems.scheduling
Classes in org.cicirello.search.problems.scheduling that implement SingleMachineSchedulingProblemDataModifier and TypeClassDescriptionfinal classThis class represents and generates instances of a common duedate scheduling problem, in which all jobs have both an earliness weight and a tardiness weight, and share a common duedate.final classThis class provides a representation of, and means of generating, instances of single machine scheduling problems involving weights and due dates, but without release dates (i.e., all jobs are released at the start of the problem at time 0, thus, the term "static" in the class name).final classThis class provides a representation of, and means of generating, instances of single machine scheduling problems involving weights, due dates, and sequence-dependent setup times, but without release dates (i.e., all jobs are released at the start of the problem at time 0, thus, the term "static" in the class name).Constructors in org.cicirello.search.problems.scheduling with parameters of type SingleMachineSchedulingProblemDataModifierConstructorDescriptionApparentTardinessCost(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an ApparentTardinessCost heuristic.ApparentTardinessCost(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data, double k) Constructs an ApparentTardinessCost heuristic.ApparentTardinessCostSetupAdjusted(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an ApparentTardinessCostSetupAdjusted heuristic.ApparentTardinessCostSetupAdjusted(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data, double k) Constructs an ApparentTardinessCostSetupAdjusted heuristic.ATCS(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an ATCS heuristic.ATCS(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data, double k1, double k2) Constructs an ATCS heuristic.Constructs an DynamicATCS heuristic.DynamicATCS(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data, double k1, double k2) Constructs an DynamicATCS heuristic.Constructs an EarliestDueDate heuristic.ExponentialEarlyTardyHeuristic(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs a ExponentialEarlyTardyHeuristic heuristic.ExponentialEarlyTardyHeuristic(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data, double k) Constructs a ExponentialEarlyTardyHeuristic heuristic.LinearEarlyTardyHeuristic(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs a LinearEarlyTardyHeuristic heuristic.LinearEarlyTardyHeuristic(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data, double k) Constructs a LinearEarlyTardyHeuristic heuristic.MinimizeMakespan(SingleMachineSchedulingProblemData instanceData) Constructs a single machine scheduling problem for minimizing makespan.MinimizeMaximumFlowtime(SingleMachineSchedulingProblemData instanceData) Constructs a single machine scheduling problem for minimizing maximum flowtime.MinimizeMaximumLateness(SingleMachineSchedulingProblemData instanceData) Constructs a single machine scheduling problem for minimizing maximum lateness.MinimizeMaximumTardiness(SingleMachineSchedulingProblemData instanceData) Constructs a single machine scheduling problem for minimizing maximum tardiness.Constructs an MinimumSlackTime heuristic.Constructs an Montagne heuristic.ShortestProcessingPlusSetupTime(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an ShortestProcessingPlusSetupTime heuristic.ShortestProcessingPlusSetupTimePrecompute(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an ShortestProcessingPlusSetupTimePrecompute heuristic.ShortestProcessingTime(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an ShortestProcessingTime heuristic.SmallestNormalizedSetup(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an SmallestNormalizedSetup heuristic.Constructs an SmallestSetup heuristic.SmallestSetupPrecompute(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an SmallestSetupPrecompute heuristic.SmallestTwoJobSetup(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an SmallestTwoJobSetup heuristic.WeightedCostOverTime(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an WeightedCostOverTime heuristic.WeightedCostOverTime(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data, double k) Constructs an WeightedCostOverTime heuristic.WeightedCostOverTimeSetupAdjusted(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an WeightedCostOverTimeSetupAdjusted heuristic.WeightedCostOverTimeSetupAdjusted(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data, double k) Constructs an WeightedCostOverTimeSetupAdjusted heuristic.WeightedCriticalRatio(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an WeightedCriticalRatio heuristic.WeightedCriticalRatioSetupAdjusted(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an WeightedCriticalRatioSetupAdjusted heuristic.WeightedEarlinessTardiness(SingleMachineSchedulingProblemData instanceData) Constructs a single machine scheduling problem for minimizing weighted earliness plus weighted tardiness.WeightedFlowtime(SingleMachineSchedulingProblemData instanceData) Constructs a single machine scheduling problem for minimizing weighted flowtime.WeightedLateness(SingleMachineSchedulingProblemData instanceData) Constructs a single machine scheduling problem for minimizing weighted lateness.WeightedLongestProcessingTime(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs a WeightedLongestProcessingTime heuristic.WeightedNumberTardyJobs(SingleMachineSchedulingProblemData instanceData) Constructs a single machine scheduling problem for minimizing weighted number of tardy jobs.WeightedShortestProcessingPlusSetupTime(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an WeightedShortestProcessingPlusSetupTime heuristic.WeightedShortestProcessingPlusSetupTimeLateOnly(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an WeightedShortestProcessingPlusSetupTimeLateOnly heuristic.WeightedShortestProcessingPlusSetupTimePrecompute(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an WeightedShortestProcessingPlusSetupTimePrecompute heuristic.WeightedShortestProcessingTime(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an WeightedShortestProcessingTime heuristic.WeightedShortestProcessingTimeLateOnly(SingleMachineSchedulingProblem problem, SingleMachineSchedulingProblemData data) Constructs an WeightedShortestProcessingTimeLateOnly heuristic.WeightedSquaredTardiness(SingleMachineSchedulingProblemData instanceData) Constructs a single machine scheduling problem for minimizing weighted squared tardiness.WeightedTardiness(SingleMachineSchedulingProblemData instanceData) Constructs a single machine scheduling problem for minimizing weighted tardiness.