discrete_optimization.jsp package

Subpackages

• discrete_optimization.jsp.solvers package
  • Submodules
  • discrete_optimization.jsp.solvers.cpsat module
    • CpSatJspSolver
      • CpSatJspSolver.get_makespan_upper_bound()
      • CpSatJspSolver.get_task_start_or_end_variable()
      • CpSatJspSolver.init_model()
      • CpSatJspSolver.problem
      • CpSatJspSolver.retrieve_solution()
      • CpSatJspSolver.set_warm_start()
  • discrete_optimization.jsp.solvers.cpsat_auto module
    • CpSatAutoJspSolver
      • CpSatAutoJspSolver.convert_task_variables_to_solution()
      • CpSatAutoJspSolver.get_makespan_upper_bound()
      • CpSatAutoJspSolver.init_model()
      • CpSatAutoJspSolver.problem
  • discrete_optimization.jsp.solvers.dp module
    • DpJspSolver
      • DpJspSolver.hyperparameters
      • DpJspSolver.init_model()
      • DpJspSolver.problem
      • DpJspSolver.retrieve_solution()
      • DpJspSolver.set_warm_start()
  • discrete_optimization.jsp.solvers.optal module
    • OptalJspSolver
      • OptalJspSolver.get_task_interval_variable()
      • OptalJspSolver.init_model()
      • OptalJspSolver.problem
      • OptalJspSolver.retrieve_solution()
  • discrete_optimization.jsp.solvers.tempo module
    • TempoJspScheduler
      • TempoJspScheduler.init_model()
      • TempoJspScheduler.problem
      • TempoJspScheduler.retrieve_solution()
    • from_jsp_to_jsplib()
    • parse_output()
  • Module contents

Submodules

discrete_optimization.jsp.parser module

discrete_optimization.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.jsp.parser.parse_file(file_path: str)

discrete_optimization.jsp.problem module

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

Bases: GenericSchedulingProblem[tuple[int, int], None, int, None], WithoutNonRenewableResourceProblem[tuple[int, int]], WithoutAllocationProblem[tuple[int, int]], SinglemodeSchedulingProblem[tuple[int, int]]

property cumulative_resources_list: list[int]

evaluate(variable: JobShopSolution) → dict[str, float]

Evaluate a given solution object for the given problem.

This method should return a dictionnary of KPI, that can be then used for mono or multiobjective optimization.

Parameters:

variable (Solution) – the Solution object to evaluate.

Returns: dictionnary of float kpi for the solution.

get_cumulative_resource_consumption(resource: int, task: tuple[int, int], mode: int) → int

Get cumulative resource consumption of the task in the given mode

Parameters:

• resource – cumulative resource

• task

• mode – not used for single mode problems

Returns:

the consumption for cumulative resources.

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_makespan_upper_bound() → int

Get an upper bound on global makespan.

get_objective_register() → ObjectiveRegister

Returns the objective definition.

Returns (ObjectiveRegister): object defining the objective criteria.

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: int) → 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_solution_type() → type[Solution]

Returns the class implementation of a Solution.

Returns (class): class object of the given Problem.

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

Get task duration according to mode.

Parameters:

task

Returns:

list_jobs: list[list[Subjob]]

n_jobs: int

n_machines: int

satisfy(variable: JobShopSolution) → bool

Computes if a solution satisfies or not the constraints of the problem.

Parameters:

variable – the Solution object to check satisfability

Returns (bool): boolean true if the constraints are fulfilled, false elsewhere.

property tasks_list: list[tuple[int, int]]

List of all tasks to schedule or allocate to.

class discrete_optimization.jsp.problem.JobShopSolution(problem: JobShopProblem, schedule: list[list[tuple[int, int]]])

Bases: GenericSchedulingSolution[tuple[int, int], None, int, None], WithoutNonRenewableResourceSolution[tuple[int, int]], WithoutAllocationSolution[tuple[int, int]], SinglemodeSchedulingSolution[tuple[int, int]]

copy() → JobShopSolution

Deep copy of the solution.

The copy() function should return a new object containing the same input as the current object, that respects the following expected behaviour: -y = x.copy() -if do some inplace change of y, the changes are not done in x.

Returns: a new object from which you can manipulate attributes without changing the original object.

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

get_max_end_time() → int

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

problem: JobShopProblem

class discrete_optimization.jsp.problem.Subjob(machine_id: int, processing_time: int)

Bases: object

machine_id: int

processing_time: int

discrete_optimization.jsp.problem.Task

(job index, subjob index).

Type:

Task representation

alias of tuple[int, int]

discrete_optimization.jsp.utils module

discrete_optimization.jsp.utils.plot_jobshop_solution(solution: JobShopSolution, title: str = 'Job Shop Schedule')

Creates a Gantt chart visualization for a JobShopSolution.

Parameters:

• solution – A JobShopSolution object containing the problem and schedule.

• title – The title for the plot.

discrete_optimization.jsp.utils.transform_jsp_to_rcpsp(jsp_problem: JobShopProblem) → RcpspProblem

Module contents