qlauncher.problems.optimization.jssp

Module for Job Shop Scheduling Problem (JSSP).

Summary

Classes:

JSSP	Class for Job Shop Scheduling Problem.

Reference

class qlauncher.problems.optimization.jssp.JSSP(max_time: int, instance: dict[str, list[tuple[str, int]]], instance_name: str = 'unnamed', optimization_problem: bool = False)

Bases: Problem

Class for Job Shop Scheduling Problem.

This class represents Job Shop Scheduling Problem (JSSP) which is a combinatorial optimization problem that involves scheduling a set of jobs on a set of machines. Each job consists of a sequence of operations that must be performed on different machines. The objective is to find a schedule that minimizes the makespan, i.e., the total time required to complete all jobs. The class contains an instance of the problem, so it can be passed into QLauncher.

max_time

The maximum time for the scheduling problem.

Type:

int

onehot

The one-hot encoding method to be used.

Type:

str

optimization_problem

Flag indicating whether the problem is an optimization problem or a decision problem.

Type:

bool

results

Dictionary to store the results of the problem instance.

Type:

dict

property setup: dict

static from_preset(instance_name: Literal['default'], **kwargs) → JSSP

classmethod from_file(path: str, **kwargs) → JSSP

to_bqm(lagrange_one_hot: float = 1, lagrange_precedence: float = 2, lagrange_share: float = 5) → BQM

to_hamiltonian(lagrange_one_hot: float = 1, lagrange_precedence: float = 2, lagrange_share: float = 5, onehot: Literal['exact', 'quadratic'] = 'exact') → Hamiltonian