job-shop-lib 1.1.1__tar.gz → 1.1.3__tar.gz

{job_shop_lib-1.1.1 → job_shop_lib-1.1.3}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: job-shop-lib
-Version: 1.1.1
+Version: 1.1.3
 Summary: An easy-to-use and modular Python library for the Job Shop Scheduling Problem (JSSP)
 License: MIT
 Author: Pabloo22
@@ -17,7 +17,8 @@ Requires-Dist: imageio[ffmpeg] (>=2.34.1,<3.0.0)
 Requires-Dist: matplotlib (>=3,<4)
 Requires-Dist: networkx (>=3,<4)
 Requires-Dist: numpy (>=1.26.4,<3.0.0)
-Requires-Dist: ortools (>=9.9,<10.0)
+Requires-Dist: ortools (>=9.9,<10.0) ; sys_platform != "darwin"
+Requires-Dist: ortools (>=9.9,<9.13) ; sys_platform == "darwin"
 Requires-Dist: pyarrow (>=15,<21)
 Requires-Dist: pygraphviz (>=1.12,<2.0) ; extra == "pygraphviz"
 Description-Content-Type: text/markdown
@@ -30,6 +31,7 @@ Description-Content-Type: text/markdown
 
 [![Tests](https://github.com/Pabloo22/job_shop_lib/actions/workflows/tests.yaml/badge.svg)](https://github.com/Pabloo22/job_shop_lib/actions/workflows/tests.yaml)
 [![Documentation Status](https://readthedocs.org/projects/job-shop-lib/badge/?version=latest)](https://job-shop-lib.readthedocs.io/en/latest/?badge=latest)
+[![codecov](https://codecov.io/gh/Pabloo22/job_shop_lib/graph/badge.svg?token=DWXLYJWAOZ)](https://codecov.io/gh/Pabloo22/job_shop_lib)
 ![Python versions](https://img.shields.io/badge/python-3.10%20%7C%203.11%20%7C%203.12-blue)
 [![Black](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/psf/black)
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
@@ -84,6 +86,24 @@ pip install job-shop-lib
 
 <!-- end key features -->
 
+## Publication :scroll:
+
+For an in-depth explanation of the library (v1.0.0), including its design, features, reinforcement learning environments, and some experiments, please refer to my [Bachelor's thesis](https://www.arxiv.org/abs/2506.13781).
+
+You can also cite the library using the following BibTeX entry:
+
+```bibtex
+@misc{arino2025jobshoplib,
+      title={Solving the Job Shop Scheduling Problem with Graph Neural Networks: A Customizable Reinforcement Learning Environment}, 
+      author={Pablo Ariño Fernández},
+      year={2025},
+      eprint={2506.13781},
+      archivePrefix={arXiv},
+      primaryClass={cs.LG},
+      url={https://arxiv.org/abs/2506.13781}, 
+}
+```
+
 ## Some Examples :rocket:
 
 ### Create a Job Shop Instance
@@ -328,31 +348,82 @@ plt.show()
 
 The library generalizes this graph by allowing the addition of job nodes and a global one (see `build_resource_task_graph_with_jobs` and `build_resource_task_graph`).
 
-For more details, check the [examples](examples) folder.
+### Gymnasium Environments
 
-## Installation for development
+<div align="center">
+<img src="docs/source/images/rl_diagram.png">
+</div>
+<br>
 
-<!-- start installation development -->
 
-1. Clone the repository.
+The `SingleJobShopGraphEnv` allows to learn from a single job shop instance, while the `MultiJobShopGraphEnv` generates a new instance at each reset. For an in-depth explanation of the environments see chapter 7 of my [Bachelor's thesis](https://www.arxiv.org/abs/2506.13781).
 
-```bash
-git clone https://github.com/Pabloo22/job_shop_lib.git
-cd job_shop_lib
-```
+```python
+from IPython.display import clear_output
+
+from job_shop_lib.reinforcement_learning import (
+    # MakespanReward,
+    SingleJobShopGraphEnv,
+    ObservationSpaceKey,
+    IdleTimeReward,
+    ObservationDict,
+)
+from job_shop_lib.dispatching.feature_observers import (
+    FeatureObserverType,
+    FeatureType,
+)
+from job_shop_lib.dispatching import DispatcherObserverConfig
+
+
+instance = load_benchmark_instance("ft06")
+job_shop_graph = build_disjunctive_graph(instance)
+feature_observer_configs = [
+    DispatcherObserverConfig(
+        FeatureObserverType.IS_READY,
+        kwargs={"feature_types": [FeatureType.JOBS]},
+    )
+]
+
+env = SingleJobShopGraphEnv(
+    job_shop_graph=job_shop_graph,
+    feature_observer_configs=feature_observer_configs,
+    reward_function_config=DispatcherObserverConfig(IdleTimeReward),
+    render_mode="human",  # Try "save_video"
+    render_config={
+        "video_config": {"fps": 4}
+    }
+)
 
-2. Install [poetry](https://python-poetry.org/docs/) if you don't have it already:
 
-```bash
-pip install poetry
-```
+def random_action(observation: ObservationDict) -> tuple[int, int]:
+    ready_jobs = []
+    for job_id, is_ready in enumerate(
+        observation[ObservationSpaceKey.JOBS.value].ravel()
+    ):
+        if is_ready == 1.0:
+            ready_jobs.append(job_id)
 
-3. Install dependencies:
-```bash
-make poetry_install_all 
+    job_id = random.choice(ready_jobs)
+    machine_id = -1  # We can use -1 if each operation can only be scheduled
+    # on one machine.
+    return (job_id, machine_id)
+
+
+done = False
+obs, _ = env.reset()
+while not done:
+    action = random_action(obs)
+    obs, reward, done, *_ = env.step(action)
+    if env.render_mode == "human":
+        env.render()
+        clear_output(wait=True)
+
+if env.render_mode == "save_video" or env.render_mode == "save_gif":
+    env.render()
 ```
 
-<!-- end installation development -->
+## Contributing :handshake:
+Any contribution is welcome, whether it's a small bug or documentation fix or a new feature! See the [CONTRIBUTING.md](CONTRIBUTING.md) file for details on how to contribute to this project.
 
 ## License :scroll:
 
@@ -389,5 +460,5 @@ This project is licensed under the MIT License - see the [LICENSE](LICENSE) file
  - E. Taillard, "Benchmarks for basic scheduling problems," European
      Journal of Operational Research, vol. 64, no. 2, pp. 278–285, 1993.
 
-- Park, Junyoung, Sanjar Bakhtiyar, and Jinkyoo Park. "ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning." arXiv preprint arXiv:2106.03051, 2021. 
+  - Park, Junyoung, Sanjar Bakhtiyar, and Jinkyoo Park. "ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning." arXiv preprint arXiv:2106.03051, 2021. 
 

{job_shop_lib-1.1.1 → job_shop_lib-1.1.3}/README.md

@@ -6,6 +6,7 @@
 
 [![Tests](https://github.com/Pabloo22/job_shop_lib/actions/workflows/tests.yaml/badge.svg)](https://github.com/Pabloo22/job_shop_lib/actions/workflows/tests.yaml)
 [![Documentation Status](https://readthedocs.org/projects/job-shop-lib/badge/?version=latest)](https://job-shop-lib.readthedocs.io/en/latest/?badge=latest)
+[![codecov](https://codecov.io/gh/Pabloo22/job_shop_lib/graph/badge.svg?token=DWXLYJWAOZ)](https://codecov.io/gh/Pabloo22/job_shop_lib)
 ![Python versions](https://img.shields.io/badge/python-3.10%20%7C%203.11%20%7C%203.12-blue)
 [![Black](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/psf/black)
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
@@ -60,6 +61,24 @@ pip install job-shop-lib
 
 <!-- end key features -->
 
+## Publication :scroll:
+
+For an in-depth explanation of the library (v1.0.0), including its design, features, reinforcement learning environments, and some experiments, please refer to my [Bachelor's thesis](https://www.arxiv.org/abs/2506.13781).
+
+You can also cite the library using the following BibTeX entry:
+
+```bibtex
+@misc{arino2025jobshoplib,
+      title={Solving the Job Shop Scheduling Problem with Graph Neural Networks: A Customizable Reinforcement Learning Environment}, 
+      author={Pablo Ariño Fernández},
+      year={2025},
+      eprint={2506.13781},
+      archivePrefix={arXiv},
+      primaryClass={cs.LG},
+      url={https://arxiv.org/abs/2506.13781}, 
+}
+```
+
 ## Some Examples :rocket:
 
 ### Create a Job Shop Instance
@@ -304,31 +323,82 @@ plt.show()
 
 The library generalizes this graph by allowing the addition of job nodes and a global one (see `build_resource_task_graph_with_jobs` and `build_resource_task_graph`).
 
-For more details, check the [examples](examples) folder.
+### Gymnasium Environments
 
-## Installation for development
+<div align="center">
+<img src="docs/source/images/rl_diagram.png">
+</div>
+<br>
 
-<!-- start installation development -->
 
-1. Clone the repository.
+The `SingleJobShopGraphEnv` allows to learn from a single job shop instance, while the `MultiJobShopGraphEnv` generates a new instance at each reset. For an in-depth explanation of the environments see chapter 7 of my [Bachelor's thesis](https://www.arxiv.org/abs/2506.13781).
 
-```bash
-git clone https://github.com/Pabloo22/job_shop_lib.git
-cd job_shop_lib
-```
+```python
+from IPython.display import clear_output
+
+from job_shop_lib.reinforcement_learning import (
+    # MakespanReward,
+    SingleJobShopGraphEnv,
+    ObservationSpaceKey,
+    IdleTimeReward,
+    ObservationDict,
+)
+from job_shop_lib.dispatching.feature_observers import (
+    FeatureObserverType,
+    FeatureType,
+)
+from job_shop_lib.dispatching import DispatcherObserverConfig
+
+
+instance = load_benchmark_instance("ft06")
+job_shop_graph = build_disjunctive_graph(instance)
+feature_observer_configs = [
+    DispatcherObserverConfig(
+        FeatureObserverType.IS_READY,
+        kwargs={"feature_types": [FeatureType.JOBS]},
+    )
+]
+
+env = SingleJobShopGraphEnv(
+    job_shop_graph=job_shop_graph,
+    feature_observer_configs=feature_observer_configs,
+    reward_function_config=DispatcherObserverConfig(IdleTimeReward),
+    render_mode="human",  # Try "save_video"
+    render_config={
+        "video_config": {"fps": 4}
+    }
+)
 
-2. Install [poetry](https://python-poetry.org/docs/) if you don't have it already:
 
-```bash
-pip install poetry
-```
+def random_action(observation: ObservationDict) -> tuple[int, int]:
+    ready_jobs = []
+    for job_id, is_ready in enumerate(
+        observation[ObservationSpaceKey.JOBS.value].ravel()
+    ):
+        if is_ready == 1.0:
+            ready_jobs.append(job_id)
 
-3. Install dependencies:
-```bash
-make poetry_install_all 
+    job_id = random.choice(ready_jobs)
+    machine_id = -1  # We can use -1 if each operation can only be scheduled
+    # on one machine.
+    return (job_id, machine_id)
+
+
+done = False
+obs, _ = env.reset()
+while not done:
+    action = random_action(obs)
+    obs, reward, done, *_ = env.step(action)
+    if env.render_mode == "human":
+        env.render()
+        clear_output(wait=True)
+
+if env.render_mode == "save_video" or env.render_mode == "save_gif":
+    env.render()
 ```
 
-<!-- end installation development -->
+## Contributing :handshake:
+Any contribution is welcome, whether it's a small bug or documentation fix or a new feature! See the [CONTRIBUTING.md](CONTRIBUTING.md) file for details on how to contribute to this project.
 
 ## License :scroll:
 
@@ -365,4 +435,4 @@ This project is licensed under the MIT License - see the [LICENSE](LICENSE) file
  - E. Taillard, "Benchmarks for basic scheduling problems," European
      Journal of Operational Research, vol. 64, no. 2, pp. 278–285, 1993.
 
-- Park, Junyoung, Sanjar Bakhtiyar, and Jinkyoo Park. "ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning." arXiv preprint arXiv:2106.03051, 2021. 
+  - Park, Junyoung, Sanjar Bakhtiyar, and Jinkyoo Park. "ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning." arXiv preprint arXiv:2106.03051, 2021. 

{job_shop_lib-1.1.1 → job_shop_lib-1.1.3}/job_shop_lib/__init__.py

@@ -19,7 +19,7 @@ from job_shop_lib._schedule import Schedule
 from job_shop_lib._base_solver import BaseSolver, Solver
 
 
-__version__ = "1.1.1"
+__version__ = "1.1.3"
 
 __all__ = [
     "Operation",

{job_shop_lib-1.1.1 → job_shop_lib-1.1.3}/job_shop_lib/_job_shop_instance.py

@@ -13,7 +13,7 @@ from job_shop_lib import Operation
 
 
 class JobShopInstance:
-    """Data structure to store a Job Shop Scheduling Problem instance.
+    r"""Data structure to store a Job Shop Scheduling Problem instance.
 
     Additional attributes such as ``num_machines`` or ``durations_matrix`` can
     be computed from the instance and are cached for performance since they
@@ -75,7 +75,7 @@ class JobShopInstance:
             attributes of the operations are set when the instance is created.
             See :meth:`set_operation_attributes` for more information. Defaults
             to True.
-        **metadata:
+        \**metadata:
             Additional information about the instance.
     """
 
@@ -131,7 +131,7 @@ class JobShopInstance:
         name: str | None = None,
         **metadata: Any,
     ) -> JobShopInstance:
-        """Creates a JobShopInstance from a file following Taillard's format.
+        r"""Creates a JobShopInstance from a file following Taillard's format.
 
         Args:
             file_path:
@@ -144,7 +144,7 @@ class JobShopInstance:
             name:
                 A string with the name of the instance. If not provided, the
                 name of the instance is set to the name of the file.
-            **metadata:
+            \**metadata:
                 Additional information about the instance.
 
         Returns:
@@ -221,7 +221,7 @@ class JobShopInstance:
                 A list of lists of integers. The i-th list contains the
                 durations of the operations of the job with id i.
             machines_matrix:
-            A list of lists of lists of integers if the
+                A list of lists of lists of integers if the
                 instance is flexible, or a list of lists of integers if the
                 instance is not flexible. The i-th list contains the machines
                 in which the operations of the job with id i can be processed.

{job_shop_lib-1.1.1 → job_shop_lib-1.1.3}/job_shop_lib/_schedule.py

@@ -10,7 +10,7 @@ from job_shop_lib.exceptions import ValidationError
 
 
 class Schedule:
-    """Data structure to store a complete or partial solution for a particular
+    r"""Data structure to store a complete or partial solution for a particular
     :class:`JobShopInstance`.
 
     A schedule is a list of lists of :class:`ScheduledOperation` objects. Each
@@ -33,7 +33,7 @@ class Schedule:
             A list of lists of :class:`ScheduledOperation` objects. Each
             list represents the order of operations on a machine. If
             not provided, the schedule is initialized as an empty schedule.
-        **metadata:
+        \**metadata:
             Additional information about the schedule.
     """
 

{job_shop_lib-1.1.1 → job_shop_lib-1.1.3}/job_shop_lib/dispatching/_dispatcher.py

@@ -30,9 +30,12 @@ def no_setup_time_calculator(
     operation belongs.
 
     Args:
-        dispatcher: The dispatcher instance.
-        operation: The operation to be scheduled.
-        machine_id: The id of the machine on which the operation is to be
+        dispatcher:
+            The dispatcher instance.
+        operation:
+            The operation to be scheduled.
+        machine_id:
+            The id of the machine on which the operation is to be
             scheduled.
 
     Returns:
@@ -329,8 +332,10 @@ class Dispatcher:
                 :attr:`~job_shop_lib.Operation.machine_id` attribute is used.
 
         Raises:
-            ValidationError: If the operation is not ready to be scheduled.
-            UninitializedAttributeError: If the operation has multiple
+            ValidationError:
+                If the operation is not ready to be scheduled.
+            UninitializedAttributeError:
+                If the operation has multiple
                 machines in its list and no ``machine_id`` is provided.
         """
 
@@ -408,7 +413,7 @@ class Dispatcher:
         condition: Callable[[DispatcherObserver], bool] = lambda _: True,
         **kwargs,
     ) -> ObserverType:
-        """Creates a new observer of the specified type or returns an existing
+        r"""Creates a new observer of the specified type or returns an existing
         observer of the same type if it already exists in the dispatcher's list
         of observers.
 
@@ -419,7 +424,7 @@ class Dispatcher:
                 A function that takes an observer and returns True if it is
                 the observer to be retrieved. By default, it returns True for
                 all observers.
-            **kwargs:
+            \**kwargs:
                 Additional keyword arguments to be passed to the observer's
                 constructor.
         """

{job_shop_lib-1.1.1 → job_shop_lib-1.1.3}/job_shop_lib/dispatching/_optimal_operations_observer.py

@@ -21,10 +21,13 @@ class OptimalOperationsObserver(DispatcherObserver):
             operations.
 
     Args:
-        dispatcher: The dispatcher instance to observe.
-        reference_schedule: A complete schedule that represents the optimal
+        dispatcher:
+            The dispatcher instance to observe.
+        reference_schedule:
+            A complete schedule that represents the optimal
             or reference solution.
-        subscribe: If True, automatically subscribes to the dispatcher.
+        subscribe:
+            If True, automatically subscribes to the dispatcher.
 
     Raises:
         ValidationError: If the reference schedule is incomplete or if it

{job_shop_lib-1.1.1 → job_shop_lib-1.1.3}/job_shop_lib/dispatching/feature_observers/_composite_feature_observer.py

@@ -11,7 +11,6 @@ import numpy as np
 from numpy.typing import NDArray
 import pandas as pd
 
-from job_shop_lib.exceptions import ValidationError
 from job_shop_lib.dispatching import Dispatcher
 from job_shop_lib.dispatching.feature_observers import (
     FeatureObserver,
@@ -86,19 +85,11 @@ class CompositeFeatureObserver(FeatureObserver):
                 for observer in dispatcher.subscribers
                 if isinstance(observer, FeatureObserver)
             ]
-        feature_types = self._get_feature_types_list(feature_types)
-        for observer in feature_observers:
-            if not set(observer.features.keys()).issubset(set(feature_types)):
-                raise ValidationError(
-                    "The feature types observed by the feature observer "
-                    f"{observer.__class__.__name__} are not a subset of the "
-                    "feature types specified in the CompositeFeatureObserver."
-                    f"Observer feature types: {observer.features.keys()}"
-                    f"Composite feature types: {feature_types}"
-                )
         self.feature_observers = feature_observers
         self.column_names: dict[FeatureType, list[str]] = defaultdict(list)
-        super().__init__(dispatcher, subscribe=subscribe)
+        super().__init__(
+            dispatcher, subscribe=subscribe, feature_types=feature_types
+        )
         self._set_column_names()
 
     @classmethod
@@ -148,12 +139,17 @@ class CompositeFeatureObserver(FeatureObserver):
             list
         )
         for observer in self.feature_observers:
-            for feature_type, feature_matrix in observer.features.items():
+            for feature_type in self.supported_feature_types:
+                feature_matrix = observer.features.get(feature_type)
+                if feature_matrix is None:
+                    continue
                 features[feature_type].append(feature_matrix)
 
         self.features = {
-            feature_type: np.concatenate(features, axis=1)
-            for feature_type, features in features.items()
+            feature_type: np.concatenate(
+                feature_matrices, axis=1  # type: ignore[misc]
+            )
+            for feature_type, feature_matrices in features.items()
         }
 
     def _set_column_names(self):
@@ -177,34 +173,3 @@ class CompositeFeatureObserver(FeatureObserver):
             out.append(f"{feature_type.value}:")
             out.append(dataframe.to_string())
         return "\n".join(out)
-
-
-if __name__ == "__main__":
-    # from cProfile import Profile
-    import time
-    from job_shop_lib.benchmarking import load_benchmark_instance
-    from job_shop_lib.dispatching.rules import DispatchingRuleSolver
-
-    ta80 = load_benchmark_instance("ta80")
-
-    dispatcher_ = Dispatcher(ta80)
-    feature_observer_types_ = list(FeatureObserverType)
-    feature_observers_ = [
-        feature_observer_factory(
-            observer_type,
-            dispatcher=dispatcher_,
-        )
-        for observer_type in feature_observer_types_
-        # and not FeatureObserverType.EARLIEST_START_TIME
-    ]
-    composite_observer_ = CompositeFeatureObserver(
-        dispatcher_, feature_observers=feature_observers_
-    )
-    solver = DispatchingRuleSolver(dispatching_rule="random")
-    # profiler = Profile()
-    # profiler.runcall(solver.solve, dispatcher_.instance, dispatcher_)
-    # profiler.print_stats("cumtime")
-    start = time.perf_counter()
-    solver.solve(dispatcher_.instance, dispatcher_)
-    end = time.perf_counter()
-    print(f"Time: {end - start}")

{job_shop_lib-1.1.1 → job_shop_lib-1.1.3}/job_shop_lib/dispatching/feature_observers/_earliest_start_time_observer.py

@@ -93,8 +93,8 @@ class EarliestStartTimeObserver(FeatureObserver):
         # Cache:
         operations_by_machine = dispatcher.instance.operations_by_machine
         self._is_regular_instance = all(
-            len(job) == len(dispatcher.instance.jobs[0])
-            for job in dispatcher.instance.jobs
+            len(machine_ops) == len(operations_by_machine[0])
+            for machine_ops in operations_by_machine
         )
         if self._is_regular_instance:
             self._job_ids = np.array(

{job_shop_lib-1.1.1 → job_shop_lib-1.1.3}/job_shop_lib/dispatching/feature_observers/_factory.py

@@ -1,5 +1,3 @@
-"""Contains factory functions for creating :class:`FeatureObserver`s."""
-
 from enum import Enum
 
 from job_shop_lib.dispatching import DispatcherObserverConfig
@@ -57,13 +55,13 @@ def feature_observer_factory(
     ),
     **kwargs,
 ) -> FeatureObserver:
-    """Creates and returns a :class:`FeatureObserver` based on the specified
+    r"""Creates and returns a :class:`FeatureObserver` based on the specified
     :class:`FeatureObserver` type.
 
     Args:
         feature_creator_type:
             The type of :class:`FeatureObserver` to create.
-        **kwargs:
+        \*\*kwargs:
             Additional keyword arguments to pass to the
             :class:`FeatureObserver` constructor.
 

{job_shop_lib-1.1.1 → job_shop_lib-1.1.3}/job_shop_lib/dispatching/feature_observers/_feature_observer.py

@@ -92,6 +92,9 @@ class FeatureObserver(DispatcherObserver):
                 feature_type: self._feature_sizes
                 for feature_type in feature_types
             }
+        else:
+            feature_size = self._feature_sizes
+
         super().__init__(dispatcher, subscribe=subscribe)
 
         number_of_entities = {

{job_shop_lib-1.1.1 → job_shop_lib-1.1.3}/job_shop_lib/dispatching/rules/_dispatching_rule_solver.py

@@ -148,49 +148,3 @@ class DispatchingRuleSolver(BaseSolver):
         selected_operation = self.dispatching_rule(dispatcher)
         machine_id = self.machine_chooser(dispatcher, selected_operation)
         dispatcher.dispatch(selected_operation, machine_id)
-
-
-if __name__ == "__main__":
-    import time
-    import cProfile
-
-    # import pstats
-    # from io import StringIO
-    from job_shop_lib.benchmarking import (
-        # load_benchmark_instance,
-        load_all_benchmark_instances,
-    )
-
-    # from job_shop_lib.dispatching.rules._dispatching_rules_functions import (
-    #     most_work_remaining_rule_2,
-    # )
-
-    # ta_instances = [
-    #     load_benchmark_instance(f"ta{i:02d}") for i in range(1, 81)
-    # ]
-    ta_instances = load_all_benchmark_instances().values()
-    solver = DispatchingRuleSolver(
-        dispatching_rule="most_work_remaining", ready_operations_filter=None
-    )
-
-    start = time.perf_counter()
-
-    # Create a Profile object
-    profiler = cProfile.Profile()
-
-    # Run the code under profiling
-    # profiler.enable()
-    for instance_ in ta_instances:
-        solver.solve(instance_)
-    # profiler.disable()
-
-    end = time.perf_counter()
-
-    # Print elapsed time
-    print(f"Elapsed time: {end - start:.2f} seconds.")
-
-    # Print profiling results
-    # s = StringIO()
-    # ps = pstats.Stats(profiler, stream=s).sort_stats("cumulative")
-    # profiler.print_stats("cumtime")  # Print top 20 time-consuming functions
-    # print(s.getvalue())