Uses of Interface
org.cicirello.search.problems.scheduling.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
Modifier and TypeClassDescriptionfinal class
This 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 class
This 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 class
This 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).Modifier and TypeMethodDescriptionMinimizeMakespan.getInstanceData()
MinimizeMaximumFlowtime.getInstanceData()
MinimizeMaximumLateness.getInstanceData()
MinimizeMaximumTardiness.getInstanceData()
SingleMachineSchedulingProblem.getInstanceData()
Gets an object that encapsulates the data describing the scheduling problem instance, such as number of jobs, and the characteristics of the jobs, such as processing times, setup times, due dates, weights, etc.WeightedEarlinessTardiness.getInstanceData()
WeightedFlowtime.getInstanceData()
WeightedLateness.getInstanceData()
WeightedNumberTardyJobs.getInstanceData()
WeightedSquaredTardiness.getInstanceData()
WeightedTardiness.getInstanceData()
ModifierConstructorDescriptionMinimizeMakespan
(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.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.WeightedNumberTardyJobs
(SingleMachineSchedulingProblemData instanceData) Constructs a single machine scheduling problem for minimizing weighted number of tardy jobs.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.