schedulr 0.8.0

Scheduling framework (activity/resource/interval DSL) built on unifier
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

use schedulr::{
    Activity, ActivityId, ConflictSeverity, Resource, ResourceId, ResourceRequirement,
    SchedulingProblem, SolveStatus, TimeWindow, compile,
};

#[test]
fn compile_solve_and_explain_a_fixed_hard_conflict() {
    let room = Resource::new(ResourceId(7), "Physics lab", 1);
    let first = Activity::new(ActivityId(1), "first", TimeWindow::new(10, 20), 10)
        .with_requirement(ResourceRequirement::new(room.id(), 1));
    let second = Activity::new(ActivityId(2), "second", TimeWindow::new(15, 25), 10)
        .with_requirement(ResourceRequirement::new(room.id(), 1));
    let compiled = compile(&SchedulingProblem::new(
        vec![room],
        vec![],
        vec![first, second],
    ))
    .expect("problem compiles");

    let result = compiled.solve();
    assert_eq!(result.status, SolveStatus::Infeasible);
    let conflicts = compiled.explain(&result);
    assert_eq!(conflicts.len(), 1);
    assert_eq!(conflicts[0].severity, ConflictSeverity::Blocking);
    assert_eq!(conflicts[0].constraint_name, "NoOverlap");
    assert_eq!(conflicts[0].involved, vec![ActivityId(1), ActivityId(2)]);
    assert!(conflicts[0].message.contains("Physics lab"));
}

#[test]
fn batch_solver_returns_domain_assignments() {
    let room = Resource::new(ResourceId(1), "Room", 1);
    let first = Activity::new(ActivityId(1), "first", TimeWindow::new(0, 5), 2)
        .with_requirement(ResourceRequirement::new(room.id(), 1));
    let second = Activity::new(ActivityId(2), "second", TimeWindow::new(0, 5), 2)
        .with_requirement(ResourceRequirement::new(room.id(), 1));
    let compiled = compile(&SchedulingProblem::new(
        vec![room],
        vec![],
        vec![first, second],
    ))
    .expect("problem compiles");

    let result = compiled.solve();
    assert_eq!(result.status, SolveStatus::Feasible);
    assert_eq!(result.solution.unwrap().assignments.len(), 2);
}