Struct SequencingWithinIntervals 

pub struct SequencingWithinIntervals { /* private fields */ }

Sequencing Within Intervals problem.

Given n tasks, each with release time r(t), deadline d(t), and processing length l(t), determine whether there exists a schedule sigma: T -> Z_>=0 such that:

• sigma(t) >= r(t) (task starts no earlier than its release time)
• sigma(t) + l(t) <= d(t) (task finishes by its deadline)
• No two tasks overlap in time

This is problem SS1 from Garey & Johnson (1979), NP-complete via Theorem 3.8.

Representation

Each task has a variable representing its start time offset from the release time. Variable i takes values in {0, ..., d(i) - r(i) - l(i)}, so the actual start time is r(i) + config[i].

Example

use problemreductions::models::misc::SequencingWithinIntervals;
use problemreductions::{Problem, Solver, BruteForce};

// 3 tasks: release_times = [0, 2, 4], deadlines = [3, 5, 7], lengths = [2, 2, 2]
let problem = SequencingWithinIntervals::new(vec![0, 2, 4], vec![3, 5, 7], vec![2, 2, 2]);
let solver = BruteForce::new();
let solution = solver.find_witness(&problem);
assert!(solution.is_some());

Implementations

impl SequencingWithinIntervals

pub fn new( release_times: Vec<u64>, deadlines: Vec<u64>, lengths: Vec<u64>, ) -> Self

Create a new SequencingWithinIntervals problem.

Panics

Panics if the three vectors have different lengths, or if any task has r(i) + l(i) > d(i) (empty time window).

pub fn release_times(&self) -> &[u64]

Returns the release times.

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

Returns the deadlines.

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

Returns the processing lengths.

pub fn num_tasks(&self) -> usize

Returns the number of tasks.

Trait Implementations

impl Clone for SequencingWithinIntervals

fn clone(&self) -> SequencingWithinIntervals

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SequencingWithinIntervals

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SequencingWithinIntervals

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for SequencingWithinIntervals

const NAME: &'static str = "SequencingWithinIntervals"

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

type Value = Or

The evaluation value type.

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

Returns variant attributes derived from type parameters.

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

Configuration space dimensions. Each entry is the cardinality of that variable.

fn evaluate(&self, config: &[usize]) -> Or

Evaluate the problem on a configuration.

fn num_variables(&self) -> usize

Number of variables (derived from dims).

fn problem_type() -> ProblemType

Look up this problem’s catalog entry.

impl ReduceTo<ILP> for SequencingWithinIntervals

type Result = ReductionSWIToILP

The reduction result type.

fn reduce_to(&self) -> Self::Result

Reduce this problem to the target problem type.

impl Serialize for SequencingWithinIntervals

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl DeclaredVariant for SequencingWithinIntervals