quantum_launcher.problems.problem_initialization.jssp

Module for Job Shop Scheduling Problem (JSSP).

Summary

Classes:

JSSP	Class for Job Shop Scheduling Problem.

Reference

class quantum_launcher.problems.problem_initialization.jssp.JSSP(max_time: int, instance: Dict[str, List[Tuple[str, int]]], instance_name: str = 'unnamed', optimization_problem: bool = False, onehot: Literal['exact', 'quadratic'] = 'exact')

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 Quantum Launcher.

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: str, **kwargs) → JSSP

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