pyscheduling.PMSP.RmridiSijkWiTi#
Module Contents#
Classes#
Helper class that provides a standard way to create an ABC using |
|
Helper class that provides a standard way to create an ABC using |
- class pyscheduling.PMSP.RmridiSijkWiTi.RmridiSijkWiTi_Instance(n: int, m: int, name: str = 'Unknown', **kwargs)#
Bases:
pyscheduling.PMSP.ParallelMachines.ParallelInstanceHelper class that provides a standard way to create an ABC using inheritance.
- P :List[List[int]]#
- W :List[int]#
- R :List[int]#
- D :List[int]#
- S :List[List[List[int]]]#
- constraints :ClassVar[pyscheduling.PMSP.ParallelMachines.Constraints]#
- objective :ClassVar[pyscheduling.Problem.Objective]#
- init_sol_method :pyscheduling.core.base_solvers.BaseSolver#
- lower_bound()#
Computes the lower bound of sum(WiTi) of the instance from the minimal completion time between job pairs on the number of machines
- Returns
Lower Bound of sum(WiTi)
- Return type
int
- class pyscheduling.PMSP.RmridiSijkWiTi.ListHeuristic#
Bases:
pyscheduling.core.base_solvers.BaseSolverHelper class that provides a standard way to create an ABC using inheritance.
- rule :int = 1#
- decreasing :bool = False#
- solve(instance: RmridiSijkWiTi_Instance)#
contains a list of static dispatching rules to be chosen from
- Parameters
instance (RmridiSijkWiTi_Instance) – Instance to be solved
rule_number (int, optional) – Index of the rule to use. Defaults to 1.
- Returns
SolveResult of the instance by the method
- Return type
RootProblem.SolveResult