Struct SequencingToMinimizeTardyTaskWeight 

pub struct SequencingToMinimizeTardyTaskWeight { /* private fields */ }

Sequencing to Minimize Tardy Task Weight problem.

Given tasks with processing times l(t), weights w(t), and deadlines d(t), find a single-machine schedule that minimizes sum_{t tardy} w(t), where task t is tardy if its completion time C(t) > d(t).

This is the weighted generalization of minimizing the number of tardy tasks (problem SS8 in Garey & Johnson, 1979, written $1 || sum w_j U_j$).

Configurations are direct permutation encodings with dims() = [n; n]: each position holds the index of the task scheduled at that position. A configuration is valid iff it is a permutation of 0..n.

Implementations

impl SequencingToMinimizeTardyTaskWeight

pub fn new(lengths: Vec<i64>, weights: Vec<i64>, deadlines: Vec<i64>) -> Self

Create a new sequencing instance.

Panics

Panics if lengths, weights, and deadlines are not all the same length, or if any length or weight is zero.

pub fn max_processing_time_bits(&self) -> u64

Smallest h >= 1 bounding every processing time in magnitude strictly by 2^h.

pub fn num_tasks(&self) -> usize

Returns the number of tasks.

pub fn lengths(&self) -> &[i64]

Returns the processing times.

pub fn weights(&self) -> &[i64]

Returns the task weights.

pub fn deadlines(&self) -> &[i64]

Returns the task deadlines.

Trait Implementations

impl BruteForceProblem for SequencingToMinimizeTardyTaskWeight

fn dimensions(&self) -> Vec<usize>

Cardinality of each coordinate in the brute-force search space.

fn num_variables(&self) -> usize

Number of coordinates in the brute-force search space.

impl Clone for SequencingToMinimizeTardyTaskWeight

fn clone(&self) -> SequencingToMinimizeTardyTaskWeight

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SequencingToMinimizeTardyTaskWeight

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl DecisionProblemMeta for SequencingToMinimizeTardyTaskWeight

const DECISION_NAME: &'static str = "DecisionSequencingToMinimizeTardyTaskWeight"

Problem name used by the corresponding Decision<Self> variant.

impl DeclaredVariant for SequencingToMinimizeTardyTaskWeight

impl<'de> Deserialize<'de> for SequencingToMinimizeTardyTaskWeight

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for SequencingToMinimizeTardyTaskWeight

const NAME: &'static str = "SequencingToMinimizeTardyTaskWeight"

Base name of this problem type (e.g., “MaximumIndependentSet”).

type Solution = Vec<usize>

Mathematical witness type for this problem.

type Value = Min<i64>

The evaluation value type.

fn parameter_names() -> &'static [&'static str]

Canonical parameter names for this problem model.

fn parameters(&self) -> ProblemParameters

Measure the complete canonical parameters of this concrete instance.

fn variant() -> Vec<(&'static str, &'static str)>

Returns variant attributes derived from type parameters.

fn evaluate(&self, config: &Self::Solution) -> Result<Min<i64>, EvaluationError>

Evaluate the problem on a solution.

fn problem_type() -> ProblemType

Look up this problem’s catalog entry.

impl ReduceTo<ILP> for SequencingToMinimizeTardyTaskWeight

type Result = ReductionSTMTTWToILP

The reduction result type.

fn reduce_to(&self) -> Result<Self::Result, ReductionError>

Reduce this problem to the target problem type.

fn target_construction(error: ConstructionError) -> ReductionError

where Self: Sized,

Attach this reduction edge to a target-construction failure.

fn exact_i64( value: usize, operation: impl Into<String>, ) -> Result<i64, ReductionError>

where Self: Sized,

Convert a structural count used by the target’s exact integer algebra.

impl Serialize for SequencingToMinimizeTardyTaskWeight

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.