discrete_optimization.shop.jsp package

Subpackages

• discrete_optimization.shop.jsp.solvers package
  • Submodules
  • discrete_optimization.shop.jsp.solvers.cpsat module
  • discrete_optimization.shop.jsp.solvers.dp module
    • DpJspSolver
      • DpJspSolver.hyperparameters
      • DpJspSolver.init_model()
      • DpJspSolver.problem
      • DpJspSolver.retrieve_solution()
      • DpJspSolver.set_warm_start()
      • DpJspSolver.transitions
  • discrete_optimization.shop.jsp.solvers.optal module
    • OptalJspSolver
      • OptalJspSolver.get_task_interval_variable()
      • OptalJspSolver.init_model()
      • OptalJspSolver.problem
      • OptalJspSolver.retrieve_solution()
  • discrete_optimization.shop.jsp.solvers.tempo module
    • TempoJspScheduler
      • TempoJspScheduler.init_model()
      • TempoJspScheduler.problem
      • TempoJspScheduler.retrieve_solution()
    • from_jsp_to_jsplib()
    • parse_output()
  • Module contents
• discrete_optimization.shop.jsp.transformations package
  • Submodules
  • discrete_optimization.shop.jsp.transformations.to_fjsp module
    • JspToFjspTransformation
      • JspToFjspTransformation.back_transform_solution()
      • JspToFjspTransformation.forward_transform_solution()
      • JspToFjspTransformation.transform_problem()
  • Module contents
    • JspToFjspTransformation
      • JspToFjspTransformation.back_transform_solution()
      • JspToFjspTransformation.forward_transform_solution()
      • JspToFjspTransformation.transform_problem()

Submodules

discrete_optimization.shop.jsp.parser module

discrete_optimization.shop.jsp.parser.get_data_available(data_folder: str | None = None, data_home: str | None = None) → list[str]

Get datasets available for jobshop.

Params:

data_folder: folder where datasets for jobshop whould be find.

If None, we look in “jobshop” subdirectory of data_home.

data_home: root directory for all datasets. Is None, set by

default to “~/discrete_optimization_data “

discrete_optimization.shop.jsp.parser.parse_file(file_path: str)

discrete_optimization.shop.jsp.problem module

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

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

get_last_tasks() → list[tuple[int, int]]

Get a sublist of tasks that are candidate to be the last one scheduled.

Default to all tasks.

get_precedence_constraints() → dict[tuple[int, int], list[tuple[int, int]]]

Map each task to the tasks that need to be performed after it.

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.jsp.problem.JobShopSolution(problem: CommonShopProblem, schedule: list[list[tuple[int, int]]], machine_index: list[list[int]] = None, recipe_index: list[list[int]] = None)

Bases: AnyShopSolution, SinglemodeSolution[tuple[int, int]]

problem: JobShopProblem

Module contents