pub fn schedule<T: Float + Sum>(
        &self,
        processing_times: &[T],
        num_resources: usize,
    ) -> Option<(Solution<T>, Stats<T>)> {
        match self {
            Self::Lpt => LongestProcessingTimeFirst.solve(processing_times, num_resources),
            Self::BnB { timeout } => {
                BranchAndBound { timeout: *timeout }.solve(processing_times, num_resources)
            }
        }
    }
/// Run scheduling algorithm determined by this instance for given task `processing_times` and
/// number of available resources (`num_resources`).
///
/// The solution will generally exist except for some edge cases when there are either no tasks
/// or resources.
Run scheduling algorithm determined by this instance for given task `processing_times` and
number of available resources (`num_resources`).

The solution will generally exist except for some edge cases when there are either no tasks
or resources.
Run scheduling algorithm determined by this instance for given task ` processing_times ` and number of available resources ( ` num_resources ` ) . The solution will generally exist except for some edge cases when there are either no tasks or resources .
pub fn schedule<T: Float + Sum>(
        &self,
        processing_times: &[T],
        num_resources: usize,
    ) -> Option<(Solution<T>, Stats<T>)> {
        match self {
            Self::Lpt => LongestProcessingTimeFirst.solve(processing_times, num_resources),
            Self::BnB { timeout } => {
                BranchAndBound { timeout: *timeout }.solve(processing_times, num_resources)
            }
        }
    }
pub fn schedule < T : Float + Sum > ( & self , processing_times : & [ T ] , num_resources : usize , ) -> Option < ( Solution < T > , Stats < T > ) > { match self { Self :: Lpt => LongestProcessingTimeFirst . solve ( processing_times , num_resources ) , Self :: BnB { timeout } => { BranchAndBound { timeout : * timeout } . solve ( processing_times , num_resources ) } } }
Run scheduling algorithm determined by this instance for given task `processing_times` and
number of available resources (`num_resources`).
Run scheduling algorithm determined by this instance for given task ` processing_times ` and number of available resources ( ` num_resources ` ) .
&self
processing_times
&[T]
num_resources
usize
&self
processing_times
&[T]
num_resources
usize