Uses of Interface
org.cicirello.search.problems.scheduling.SingleMachineSchedulingProblem

Packages that use SingleMachineSchedulingProblem

Package	Description
org.cicirello.search.problems.scheduling	Package of classes and interfaces related to representing and solving scheduling problems, which includes implementations of constructive heuristics for scheduling problems.

Uses of SingleMachineSchedulingProblem in org.cicirello.search.problems.scheduling

Classes in org.cicirello.search.problems.scheduling that implement SingleMachineSchedulingProblem

Modifier and Type	Class	Description
final class	MinimizeMakespan	Implements the common scheduling cost function known as makespan.
final class	MinimizeMaximumFlowtime	Implements the scheduling cost function known as maximum flowtime (which we want to minimize).
final class	MinimizeMaximumLateness	Implements the scheduling cost function known as maximum lateness, which we want to minimize.
final class	MinimizeMaximumTardiness	Implements the scheduling cost function known as maximum tardiness, which we want to minimize.
final class	WeightedEarlinessTardiness	Implements the scheduling cost function known as weighted earliness plus weighted tardiness.
final class	WeightedFlowtime	Implements the scheduling cost function known as weighted flowtime.
final class	WeightedLateness	Implements the scheduling cost function known as weighted lateness.
final class	WeightedNumberTardyJobs	Implements the scheduling cost function known as weighted number of tardy jobs, which we want to minimize.
final class	WeightedSquaredTardiness	Implements the scheduling cost function known as weighted squared tardiness.
final class	WeightedTardiness	Implements the scheduling cost function known as weighted tardiness.

Constructors in org.cicirello.search.problems.scheduling with parameters of type SingleMachineSchedulingProblem

Modifier	Constructor	Description
	ApparentTardinessCost(SingleMachineSchedulingProblem problem)	Constructs an ApparentTardinessCost heuristic.
	ApparentTardinessCost(SingleMachineSchedulingProblem problem, double k)	Constructs an ApparentTardinessCost heuristic.
	ApparentTardinessCostSetupAdjusted(SingleMachineSchedulingProblem problem)	Constructs an ApparentTardinessCostSetupAdjusted heuristic.
	ApparentTardinessCostSetupAdjusted(SingleMachineSchedulingProblem problem, double k)	Constructs an ApparentTardinessCostSetupAdjusted heuristic.
	ATCS(SingleMachineSchedulingProblem problem)	Constructs an ATCS heuristic.
	ATCS(SingleMachineSchedulingProblem problem, double k1, double k2)	Constructs an ATCS heuristic.
	DynamicATCS(SingleMachineSchedulingProblem problem)	Constructs an DynamicATCS heuristic.
	DynamicATCS(SingleMachineSchedulingProblem problem, double k1, double k2)	Constructs an DynamicATCS heuristic.
	EarliestDueDate(SingleMachineSchedulingProblem problem)	Constructs an EarliestDueDate heuristic.
	ExponentialEarlyTardyHeuristic(SingleMachineSchedulingProblem problem)	Constructs a ExponentialEarlyTardyHeuristic heuristic.
	ExponentialEarlyTardyHeuristic(SingleMachineSchedulingProblem problem, double k)	Constructs a ExponentialEarlyTardyHeuristic heuristic.
	LinearEarlyTardyHeuristic(SingleMachineSchedulingProblem problem)	Constructs a LinearEarlyTardyHeuristic heuristic.
	LinearEarlyTardyHeuristic(SingleMachineSchedulingProblem problem, double k)	Constructs a LinearEarlyTardyHeuristic heuristic.
	MinimumSlackTime(SingleMachineSchedulingProblem problem)	Constructs an MinimumSlackTime heuristic.
	Montagne(SingleMachineSchedulingProblem problem)	Constructs an Montagne heuristic.
	ShortestProcessingPlusSetupTime(SingleMachineSchedulingProblem problem)	Constructs an ShortestProcessingPlusSetupTime heuristic.
	ShortestProcessingPlusSetupTimePrecompute(SingleMachineSchedulingProblem problem)	Constructs an ShortestProcessingPlusSetupTimePrecompute heuristic.
	ShortestProcessingTime(SingleMachineSchedulingProblem problem)	Constructs an ShortestProcessingTime heuristic.
	SmallestNormalizedSetup(SingleMachineSchedulingProblem problem)	Constructs an SmallestNormalizedSetup heuristic.
	SmallestSetup(SingleMachineSchedulingProblem problem)	Constructs an SmallestSetup heuristic.
	SmallestSetupPrecompute(SingleMachineSchedulingProblem problem)	Constructs an SmallestSetupPrecompute heuristic.
	SmallestTwoJobSetup(SingleMachineSchedulingProblem problem)	Constructs an SmallestTwoJobSetup heuristic.
	WeightedCostOverTime(SingleMachineSchedulingProblem problem)	Constructs an WeightedCostOverTime heuristic.
	WeightedCostOverTime(SingleMachineSchedulingProblem problem, double k)	Constructs an WeightedCostOverTime heuristic.
	WeightedCostOverTimeSetupAdjusted(SingleMachineSchedulingProblem problem)	Constructs an WeightedCostOverTimeSetupAdjusted heuristic.
	WeightedCostOverTimeSetupAdjusted(SingleMachineSchedulingProblem problem, double k)	Constructs an WeightedCostOverTimeSetupAdjusted heuristic.
	WeightedCriticalRatio(SingleMachineSchedulingProblem problem)	Constructs an WeightedCriticalRatio heuristic.
	WeightedCriticalRatioSetupAdjusted(SingleMachineSchedulingProblem problem)	Constructs an WeightedCriticalRatioSetupAdjusted heuristic.
	WeightedLongestProcessingTime(SingleMachineSchedulingProblem problem)	Constructs a WeightedLongestProcessingTime heuristic.
	WeightedShortestProcessingPlusSetupTime(SingleMachineSchedulingProblem problem)	Constructs an WeightedShortestProcessingPlusSetupTime heuristic.
	WeightedShortestProcessingPlusSetupTimeLateOnly(SingleMachineSchedulingProblem problem)	Constructs an WeightedShortestProcessingPlusSetupTimeLateOnly heuristic.
	WeightedShortestProcessingPlusSetupTimePrecompute(SingleMachineSchedulingProblem problem)	Constructs an WeightedShortestProcessingPlusSetupTimePrecompute heuristic.
	WeightedShortestProcessingTime(SingleMachineSchedulingProblem problem)	Constructs an WeightedShortestProcessingTime heuristic.
	WeightedShortestProcessingTimeLateOnly(SingleMachineSchedulingProblem problem)	Constructs an WeightedShortestProcessingTimeLateOnly heuristic.