Interface SingleMachineSchedulingProblem
- All Superinterfaces:
IntegerCostOptimizationProblem<Permutation>, Problem<Permutation>
- All Known Implementing Classes:
MinimizeMakespan, MinimizeMaximumFlowtime, MinimizeMaximumLateness, MinimizeMaximumTardiness, WeightedEarlinessTardiness, WeightedFlowtime, WeightedLateness, WeightedNumberTardyJobs, WeightedSquaredTardiness, WeightedTardiness
Implement this interface to define a single machine scheduling problem. A class that implements
this interface should implement the cost function for the problem (i.e., the function we are
optimizing) and should utilize a class implementing the
SingleMachineSchedulingProblemData interface to represent the data describing the instance, such
as processing times, due dates, etc. You may have a single class that implements both interfaces,
if desired.-
Method Summary
Methods inherited from interface IntegerCostOptimizationProblem
cost, costAsDouble, getSolutionCostPair, isMinCost, minCost, value