discrete_optimization.shop.osp package

Subpackages

• discrete_optimization.shop.osp.solvers package
  • Submodules
  • discrete_optimization.shop.osp.solvers.cpsat module
  • discrete_optimization.shop.osp.solvers.dp module
    • DpOspSolver
      • DpOspSolver.init_model()
      • DpOspSolver.problem
      • DpOspSolver.retrieve_solution()
      • DpOspSolver.set_warm_start()
      • DpOspSolver.time_per_job
      • DpOspSolver.time_per_machine
      • DpOspSolver.transitions
      • DpOspSolver.transitions_name_to_index
  • Module contents

Submodules

discrete_optimization.shop.osp.problem module

class discrete_optimization.shop.osp.problem.OpenShopProblem(list_jobs: list[Job], n_jobs: int = None, n_machines: int = None, horizon: int = None)

Bases: CommonShopProblem, SinglemodeSchedulingProblem[tuple[int, int]], WithoutPrecedenceProblem[tuple[int, int]]

get_resource_availabilities(resource: Resource) → list[tuple[int, int, int]]

Get availabilities intervals for a given resource

List of availability intervals of a resource. If the resource is not available, potentially no interval returned.

It is assumed that the intervals are disjunct though.

Parameters:

resource

Returns:

list of intervals of the form (start, end, value), which means from time start to time end, there are value of the resource available. NB: the start is included, the end is excluded (start <= t < end)

get_task_duration(task: tuple[int, int]) → int

Get task duration according to mode.

Parameters:

task

Returns:

class discrete_optimization.shop.osp.problem.OpenShopSolution(problem: CommonShopProblem, schedule: list[list[tuple[int, int]]], machine_index: list[list[int]] = None, recipe_index: list[list[int]] = None)

Bases: AnyShopSolution, SinglemodeSchedulingSolution[tuple[int, int]], WithoutPrecedenceSolution[tuple[int, int]]

problem: OpenShopProblem

Module contents