This Rust library implements several solvers for task scheduling problems optimizing makespan.
Definitions of scheduling problems in operations research commonly use
Graham's notation a|b|c
where
a
defines machine environment (resources)b
denotes task/job characteristicsc
specifies the objective function that is to be minimized (note that this library
focuses on optimizing the makespan C_max
)The module structure of this library follows a structure of the general taxonomy of scheduling
problems and as mentioned above focuses on minimizing the makespan (C_max
).
General constraints:
This class of scheduling problems considers single processing unit (resource).
This sub-class considers non-preemptive tasks and is covered by module sp
. The
list of problems and corresponding algorithms includes:
1||C_max
: optimal, linear1|prec|C_max
: optimal, linear1|r_j|C_max
: optimal, log-linear1|d'_j|C_max
: EDF (optimal, log-linear)1|r_j,d'_j|C_max
: heuristic (log-linear), Bratley's BnB (optimal)1|chains,r_j|C_max
: special case with chains
totally ordered (otpimal, linear)This class of scheduling problems considers multiple processing units (resources).
This sub-class considers non-preemptive tasks and is covered by module mp
. The
list of problems and corresponding algorithms includes:
P||C_max
: LPT (approx), BnB (optimal)This sub-class considers preemptive tasks and is covered by module mp_pmtn
.
The list of problems and corresponding algorithms includes:
P|pmtn|C_max
: McNaughton (optimal)Current version: 0.3.0
License: MIT OR Apache-2.0