job-shop-lib 1.0.0a1__py3-none-any.whl → 1.0.0a2__py3-none-any.whl

job_shop_lib/dispatching/feature_observers/_is_completed_observer.py

@@ -15,8 +15,38 @@ from job_shop_lib.dispatching.feature_observers import (
 
 
 class IsCompletedObserver(FeatureObserver):
-    """Observer that adds a binary feature indicating whether each operation,
-    machine, or job has been completed."""
+    """Adds a binary feature indicating whether each operation,
+    machine, or job has been completed.
+
+    An operation is considered completed if it has been scheduled and the
+    current time is greater than or equal to the sum of the operation's start
+    time and duration.
+
+    A machine or job is considered completed if all of its operations have been
+    completed.
+
+    Args:
+        dispatcher:
+            The :class:`~job_shop_lib.dispatching.Dispatcher` to observe.
+        feature_types:
+            A list of :class:`FeatureType` or a single :class:`FeatureType`
+            that specifies the types of features to observe. They must be a
+            subset of the class attribute :attr:`supported_feature_types`.
+            If ``None``, all supported feature types are tracked.
+        subscribe:
+            If ``True``, the observer is subscribed to the dispatcher upon
+            initialization. Otherwise, the observer must be subscribed later
+            or manually updated.
+    """
+
+    __slots__ = {
+        "remaining_ops_per_machine": (
+            "The number of unscheduled operations per machine."
+        ),
+        "remaining_ops_per_job": (
+            "The number of unscheduled operations per job."
+        ),
+    }
 
     def __init__(
         self,

job_shop_lib/dispatching/feature_observers/_is_ready_observer.py

@@ -7,8 +7,8 @@ from job_shop_lib.dispatching.feature_observers import (
 
 
 class IsReadyObserver(FeatureObserver):
-    """Feature creator that adds a binary feature indicating if the operation
-    is ready to be dispatched."""
+    """Feature creator that adds a binary feature indicating if the operation,
+    machine or job is ready to be dispatched."""
 
     def initialize_features(self):
         self.set_features_to_zero()

job_shop_lib/dispatching/feature_observers/_is_scheduled_observer.py

@@ -8,14 +8,18 @@ from job_shop_lib.dispatching.feature_observers import (
 
 
 class IsScheduledObserver(FeatureObserver):
-    """Observer that updates features based on scheduling operations.
+    """Updates features based on scheduling operations.
 
     This observer tracks which operations have been scheduled and updates
-    feature matrices accordingly. It updates a feature in the
-    `FeatureType.OPERATIONS` matrix to indicate that an operation has been
-    scheduled. Additionally, it counts the number of uncompleted but
+    feature matrices accordingly.
+
+    It updates a feature in the
+    :meth:`FeatureType.OPERATIONS` matrix to indicate that an operation has
+    been scheduled.
+
+    Additionally, it counts the number of uncompleted but
     scheduled operations for each machine and job, updating the respective
-    `FeatureType.MACHINES` and `FeatureType.JOBS` feature matrices.
+    :meth:`FeatureType.MACHINES` and :meth:`FeatureType.JOBS` feature matrices.
     """
 
     def update(self, scheduled_operation: ScheduledOperation):

job_shop_lib/dispatching/feature_observers/_position_in_job_observer.py

@@ -8,10 +8,15 @@ from job_shop_lib.dispatching.feature_observers import (
 
 
 class PositionInJobObserver(FeatureObserver):
-    """Observer that adds a feature indicating the position of
+    """Adds a feature indicating the position of
     operations in their respective jobs.
 
-    Positions are adjusted dynamically as operations are scheduled.
+    Positions are adjusted dynamically as operations are scheduled. In other
+    words, the position of an operation is the number of unscheduled operations
+    that precede it in the job.
+
+    It only supports the :meth:`~job_shop_lib.FeatureType.OPERATIONS` feature
+    type.
     """
 
     _supported_feature_types = [FeatureType.OPERATIONS]

job_shop_lib/dispatching/feature_observers/_remaining_operations_observer.py

@@ -12,7 +12,7 @@ class RemainingOperationsObserver(FeatureObserver):
     """Adds a feature indicating the number of remaining operations for each
     job and machine.
 
-    It does not support :class:`FeatureType.OPERATIONS`.
+    It does not support :meth:`FeatureType.OPERATIONS`.
     """
 
     _supported_feature_types = [FeatureType.MACHINES, FeatureType.JOBS]

job_shop_lib/dispatching/rules/_dispatching_rule_solver.py

@@ -40,7 +40,7 @@ class DispatchingRuleSolver(BaseSolver):
         machine_chooser: (
             str | Callable[[Dispatcher, Operation], int]
         ) = MachineChooserType.FIRST,
-        pruning_function: (
+        ready_operations_filter: (
             str
             | Callable[[Dispatcher, list[Operation]], list[Operation]]
             | None
@@ -60,25 +60,25 @@ class DispatchingRuleSolver(BaseSolver):
                 of the machine chooser, a MachineChooser enum member, or a
                 callable that takes a dispatcher and an operation and returns
                 the machine id where the operation will be dispatched.
-            pruning_function:
-                The pruning function to use. It can be a string with the name
-                of the pruning function, a PruningFunction enum member, or a
-                callable that takes a dispatcher and a list of operations and
-                returns a list of operations that should be considered for
-                dispatching.
+            ready_operations_filter:
+                The ready operations filter to use. It can be a string with
+                the name of the pruning function, a PruningFunction enum
+                member, or a callable that takes a dispatcher and a list of
+                operations and returns a list of operations that should be
+                considered for dispatching.
         """
         if isinstance(dispatching_rule, str):
             dispatching_rule = dispatching_rule_factory(dispatching_rule)
         if isinstance(machine_chooser, str):
             machine_chooser = machine_chooser_factory(machine_chooser)
-        if isinstance(pruning_function, str):
-            pruning_function = ready_operations_filter_factory(
-                pruning_function
+        if isinstance(ready_operations_filter, str):
+            ready_operations_filter = ready_operations_filter_factory(
+                ready_operations_filter
             )
 
         self.dispatching_rule = dispatching_rule
         self.machine_chooser = machine_chooser
-        self.pruning_function = pruning_function
+        self.ready_operations_filter = ready_operations_filter
 
     def solve(
         self, instance: JobShopInstance, dispatcher: Dispatcher | None = None
@@ -87,7 +87,7 @@ class DispatchingRuleSolver(BaseSolver):
         dispatching rule algorithm."""
         if dispatcher is None:
             dispatcher = Dispatcher(
-                instance, ready_operations_filter=self.pruning_function
+                instance, ready_operations_filter=self.ready_operations_filter
             )
         while not dispatcher.schedule.is_complete():
             self.step(dispatcher)
@@ -110,19 +110,23 @@ class DispatchingRuleSolver(BaseSolver):
 if __name__ == "__main__":
     import time
     import cProfile
-    import pstats
-    from io import StringIO
-    from job_shop_lib.benchmarking import load_benchmark_instance
+    # 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_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", pruning_function=None
+        dispatching_rule="most_work_remaining", ready_operations_filter=None
     )
 
     start = time.perf_counter()
@@ -131,10 +135,10 @@ if __name__ == "__main__":
     profiler = cProfile.Profile()
 
     # Run the code under profiling
-    profiler.enable()
+    # profiler.enable()
     for instance_ in ta_instances:
         solver.solve(instance_)
-    profiler.disable()
+    # profiler.disable()
 
     end = time.perf_counter()
 
@@ -142,7 +146,7 @@ if __name__ == "__main__":
     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
+    # s = StringIO()
+    # ps = pstats.Stats(profiler, stream=s).sort_stats("cumulative")
+    # profiler.print_stats("cumtime")  # Print top 20 time-consuming functions
     # print(s.getvalue())

job_shop_lib/graphs/__init__.py

@@ -1,5 +1,7 @@
 """Package for graph related classes and functions.
 
+The main classes and functions available in this package are:
+
 .. autosummary::
     JobShopGraph
     Node

job_shop_lib/graphs/_build_agent_task_graph.py

@@ -13,8 +13,8 @@ job, and the global node is connected to all machine and job nodes.
 
 References:
 - Junyoung Park, Sanjar Bakhtiyar, and Jinkyoo Park. Schedulenet: Learn to
-solve multi-agent scheduling problems with reinforcement learning. ArXiv,
-abs/2106.03051, 2021.
+  solve multi-agent scheduling problems with reinforcement learning. ArXiv,
+  abs/2106.03051, 2021.
 """
 
 import itertools

job_shop_lib/graphs/_constants.py

@@ -11,7 +11,24 @@ class EdgeType(enum.Enum):
 
 
 class NodeType(enum.Enum):
-    """Enumeration of node types."""
+    """Enumeration of node types.
+
+    Nodes of type :class:`NodeType.OPERATION`, :class:`NodeType.MACHINE`, and
+    :class:`NodeType.JOB` have specific attributes associated with them in the
+    :class:`Node` class.
+
+    On the other hand, Nodes of type :class:`NodeType.GLOBAL`,
+    :class:`NodeType.SOURCE`, and :class:`NodeType.SINK` are used to represent
+    different concepts in the graph and accesing them, but they do not have
+    specific attributes associated with them.
+
+    .. tip::
+
+        While uncommon, it can be useful to extend this enumeration with
+        additional node types. This can be achieved using
+        `aenum <https://github.com/ethanfurman/aenum>`_'s
+        ``extend_enum`` (requires using Python 3.11+).
+    """
 
     OPERATION = enum.auto()
     MACHINE = enum.auto()

job_shop_lib/graphs/_job_shop_graph.py

@@ -13,10 +13,10 @@ NODE_ATTR = "node"
 
 # pylint: disable=too-many-instance-attributes
 class JobShopGraph:
-    """Data structure to represent a `JobShopInstance` as a graph.
+    """Represents a :class:`JobShopInstance` as a heterogeneous directed graph.
 
     Provides a comprehensive graph-based representation of a job shop
-    scheduling problem, utilizing the `networkx` library to model the complex
+    scheduling problem, utilizing the ``networkx`` library to model the complex
     relationships between jobs, operations, and machines. This class transforms
     the abstract scheduling problem into a directed graph, where various
     entities (jobs, machines, and operations) are nodes, and the dependencies
@@ -25,25 +25,40 @@ class JobShopGraph:
     This transformation allows for the application of graph algorithms
     to analyze and solve scheduling problems.
 
-    Attributes:
+    Args:
         instance:
-            The job shop instance encapsulated by this graph.
-        graph:
-            The directed graph representing the job shop, where nodes are
-                operations, machines, jobs, or abstract concepts like global,
-                source, and sink, with edges indicating dependencies.
+            The job shop instance that the graph represents.
+        add_operation_nodes:
+            Whether to add nodes of type :class:`NodeType.OPERATION` to the
+            to the graph. If set to ``False``, the graph will be empty, and
+            operation nodes will need to be added manually.
     """
 
-    def __init__(self, instance: JobShopInstance):
-        """Initializes the graph with the given instance.
-
-        Nodes of type `OPERATION` are added to the graph based on the
-        operations of the instance.
-
-        Args:
-            instance:
-                The job shop instance that the graph represents.
-        """
+    __slots__ = {
+        "instance": "The job shop instance that the graph represents.",
+        "graph": (
+            "The directed graph representing the job shop, where nodes are "
+            "operations, machines, jobs, or abstract concepts like global, "
+            "source, and sink, with edges indicating dependencies."
+        ),
+        "_nodes": "List of all nodes added to the graph.",
+        "_nodes_by_type": "Dictionary mapping node types to lists of nodes.",
+        "_nodes_by_machine": (
+            "List of lists mapping machine ids to operation nodes."
+        ),
+        "_nodes_by_job": "List of lists mapping job ids to operation nodes.",
+        "_next_node_id": (
+            "The id to assign to the next node added to thegraph."
+        ),
+        "removed_nodes": (
+            "List of boolean values indicating whether a node has been "
+            "removed from the graph."
+        ),
+    }
+
+    def __init__(
+        self, instance: JobShopInstance, add_operation_nodes: bool = True
+    ):
         self.graph = nx.DiGraph()
         self.instance = instance
 
@@ -59,7 +74,8 @@ class JobShopGraph:
         ]
         self._next_node_id = 0
         self.removed_nodes: list[bool] = []
-        self._add_operation_nodes()
+        if add_operation_nodes:
+            self.add_operation_nodes()
 
     @property
     def nodes(self) -> list[Node]:
@@ -103,7 +119,7 @@ class JobShopGraph:
         """Number of job nodes in the graph."""
         return len(self._nodes_by_type[NodeType.JOB])
 
-    def _add_operation_nodes(self) -> None:
+    def add_operation_nodes(self) -> None:
         """Adds operation nodes to the graph."""
         for job in self.instance.jobs:
             for operation in job:

job_shop_lib/graphs/_node.py

@@ -9,7 +9,7 @@ from job_shop_lib.graphs._constants import NodeType
 
 
 class Node:
-    """Data structure to represent a node in the `JobShopGraph`.
+    """Represents a node in the :class:`JobShopGraph`.
 
     A node is hashable by its id. The id is assigned when the node is added to
     the graph. The id must be unique for each node in the graph, and should be
@@ -18,11 +18,15 @@ class Node:
     Depending on the type of the node, it can have different attributes. The
     following table shows the attributes of each type of node:
 
-    Node Type       | Required Attribute
-    ----------------|---------------------
-    OPERATION       | `operation`
-    MACHINE         | `machine_id`
-    JOB             | `job_id`
+    +----------------+---------------------+
+    | Node Type      | Required Attribute  |
+    +================+=====================+
+    | OPERATION      | ``operation``       |
+    +----------------+---------------------+
+    | MACHINE        | ``machine_id``      |
+    +----------------+---------------------+
+    | JOB            | ``job_id``          |
+    +----------------+---------------------+
 
     In terms of equality, two nodes are equal if they have the same id.
     Additionally, one node is equal to an integer if the integer is equal to
@@ -31,25 +35,47 @@ class Node:
     This allows for using the node as a key in a dictionary, at the same time
     we can use its id to index that dictionary. Example:
 
-    ```python
-    node = Node(NodeType.SOURCE)
-    node.node_id = 1
-    graph = {node: "some value"}
-    print(graph[node])  # "some value"
-    print(graph[1])  # "some value"
-    ```
+    .. code-block:: python
 
-    Attributes:
+        node = Node(NodeType.SOURCE)
+        node.node_id = 1
+        graph = {node: "some value"}
+        print(graph[node])  # "some value"
+        print(graph[1])  # "some value"
+
+    Args:
         node_type:
-            The type of the node. It can be one of the following:
-            - NodeType.OPERATION
-            - NodeType.MACHINE
-            - NodeType.JOB
-            - NodeType.GLOBAL
-            ...
+            The type of the node. See :class:`NodeType` for theavailable types.
+        operation:
+            The operation of the node. Required if ``node_type`` is
+            :attr:`NodeType.OPERATION`.
+        machine_id:
+            The id of the machine. Required if ``node_type`` is
+            :attr:`NodeType.MACHINE`.
+        job_id:
+            The id of the job. Required if ``node_type`` is
+            :attr:`NodeType.JOB`.
+
+    Raises:
+        ValidationError:
+            If the ``node_type`` is :attr:`NodeType.OPERATION`,
+            :attr:`NodeType.MACHINE`, or :attr:`NodeType.JOB` and the
+            corresponding ``operation``, ``machine_id``, or ``job_id`` is
+            ``None``, respectively.
+
     """
 
-    __slots__ = "node_type", "_node_id", "_operation", "_machine_id", "_job_id"
+    __slots__ = {
+        "node_type": "The type of the node.",
+        "_node_id": "Unique identifier for the node.",
+        "_operation": (
+            "The operation associated with the node."
+        ),
+        "_machine_id": (
+            "The machine ID associated with the node."
+        ),
+        "_job_id": "The job ID associated with the node.",
+    }
 
     def __init__(
         self,
@@ -58,34 +84,6 @@ class Node:
         machine_id: int | None = None,
         job_id: int | None = None,
     ):
-        """Initializes the node with the given attributes.
-
-        Args:
-            node_type:
-                The type of the node. It can be one of the following:
-                - NodeType.OPERATION
-                - NodeType.MACHINE
-                - NodeType.JOB
-                - NodeType.GLOBAL
-                ...
-            operation:
-                The operation of the node. It should be provided if the
-                `node_type` is NodeType.OPERATION.
-            machine_id:
-                The id of the machine of the node. It should be provided if the
-                node_type is NodeType.MACHINE.
-            job_id:
-                The id of the job of the node. It should be provided if the
-                node_type is NodeType.JOB.
-
-        Raises:
-            ValidationError:
-                If the node_type is OPERATION and operation is None.
-            ValidationError:
-                If the node_type is MACHINE and machine_id is None.
-            ValidationError:
-                If the node_type is JOB and job_id is None.
-        """
         if node_type == NodeType.OPERATION and operation is None:
             raise ValidationError("Operation node must have an operation.")
 
@@ -95,7 +93,7 @@ class Node:
         if node_type == NodeType.JOB and job_id is None:
             raise ValidationError("Job node must have a job_id.")
 
-        self.node_type = node_type
+        self.node_type: NodeType = node_type
         self._node_id: int | None = None
 
         self._operation = operation
@@ -119,7 +117,11 @@ class Node:
     def operation(self) -> Operation:
         """Returns the operation of the node.
 
-        This property is mandatory for nodes of type `OPERATION`.
+        This property is mandatory for nodes of type
+        :class:`NodeType.OPERATION`.
+
+        Raises:
+            UninitializedAttributeError: If the node has no operation.
         """
         if self._operation is None:
             raise UninitializedAttributeError("Node has no operation.")
@@ -130,9 +132,12 @@ class Node:
         """Returns the `machine_id` of the node.
 
         This property is mandatory for nodes of type `MACHINE`.
+
+        Raises:
+            UninitializedAttributeError: If the node has no ``machine_id``.
         """
         if self._machine_id is None:
-            raise UninitializedAttributeError("Node has no `machine_id`.")
+            raise UninitializedAttributeError("Node has no ``machine_id``.")
         return self._machine_id
 
     @property
@@ -140,6 +145,9 @@ class Node:
         """Returns the `job_id` of the node.
 
         This property is mandatory for nodes of type `JOB`.
+
+        Raises:
+            UninitializedAttributeError: If the node has no `job_id`.
         """
         if self._job_id is None:
             raise UninitializedAttributeError("Node has no `job_id`.")

job_shop_lib/graphs/graph_updaters/__init__.py

@@ -1,5 +1,15 @@
 """Contains classes and functions for updating the graph representation of the
-job shop scheduling problem."""
+job shop scheduling problem.
+
+Currently, the following classes and utilities are available:
+
+.. autosummary::
+
+    GraphUpdater
+    ResidualGraphUpdater
+    remove_completed_operations
+
+"""
 
 from ._graph_updater import GraphUpdater
 from ._utils import remove_completed_operations

job_shop_lib/visualization/_gantt_chart_video_and_gif_creation.py

@@ -263,7 +263,7 @@ def create_gantt_chart_frames(
     """
     if solver is not None and schedule_history is None:
         dispatcher = Dispatcher(
-            instance, ready_operations_filter=solver.pruning_function
+            instance, ready_operations_filter=solver.ready_operations_filter
         )
         history_tracker = HistoryObserver(dispatcher)
         makespan = solver.solve(instance, dispatcher).makespan()

{job_shop_lib-1.0.0a1.dist-info → job_shop_lib-1.0.0a2.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: job-shop-lib
-Version: 1.0.0a1
+Version: 1.0.0a2
 Summary: An easy-to-use and modular Python library for the Job Shop Scheduling Problem (JSSP)
 License: MIT
 Author: Pabloo22

{job_shop_lib-1.0.0a1.dist-info → job_shop_lib-1.0.0a2.dist-info}/RECORD

@@ -1,14 +1,14 @@
 job_shop_lib/__init__.py,sha256=Ci5ipn-zciO88C5aX5Wx-UN8iBTbpde3dSSg02ZcfwM,597
 job_shop_lib/_base_solver.py,sha256=p17XmtufNc9Y481cqZUT45pEkUmmW1HWG53dfhIBJH8,1363
 job_shop_lib/_job_shop_instance.py,sha256=Q0ml3C36tmcBskBo8MyaZWILJPbdvHjJcvXzD_YfLsU,16475
-job_shop_lib/_operation.py,sha256=8Wj8ZLpxmHw4lJJbLCZoTpFhLaap9MSzwOA5VOJQ-DY,3099
-job_shop_lib/_schedule.py,sha256=2QjhU21pZr7Gl6qEVJ9kXujx-bSrvaTdyZvjGbrQqzs,11193
-job_shop_lib/_scheduled_operation.py,sha256=w7jKhgJ4dQycJ5wSItAd_B9gH5ipcoqy5KxtHFxWTP0,2775
+job_shop_lib/_operation.py,sha256=lJ4srQs82cYhUYuBxqkfKr9MuZoG0X2x0z3M1_QXkAs,3360
+job_shop_lib/_schedule.py,sha256=H6PREUE9KCC0DtrQV8y9MB8S4sh3qnDwby5Y4WVDfzg,11333
+job_shop_lib/_scheduled_operation.py,sha256=ptqYRW39EvG5tnk4DLQGFCOkbGTTYIQJhUMcuLSbdSA,2812
 job_shop_lib/benchmarking/__init__.py,sha256=BYCrJUNr_uk2c0xIbDt07OnUMhQx8Dudkukx3TFWxgw,3271
 job_shop_lib/benchmarking/_load_benchmark.py,sha256=-cgyx0Kn6uAc3KdGFSQb6eUVQjQggmpVKOH9qusNkXI,2930
 job_shop_lib/benchmarking/benchmark_instances.json,sha256=F9EvyzFwVxiKAN6rQTsrMhsKstmyUmroyWduM7a00KQ,464841
 job_shop_lib/constraint_programming/__init__.py,sha256=kKQRUxxS_nVFUdXGnf4bQOD9mqrXxZZWElS753A4YiA,454
-job_shop_lib/constraint_programming/_ortools_solver.py,sha256=U6kkk2pHsAgKLOhEjl6R1FFLy-i5_5sxBHaXezMR1tI,9860
+job_shop_lib/constraint_programming/_ortools_solver.py,sha256=gRoImEBUa8_io-TzbSS-3f0CJ7UwacU5Lrz0bsDqibo,10462
 job_shop_lib/dispatching/__init__.py,sha256=QV7qy-y0sSoKp_FslTm7sdqczYzpq0YctzKQ36l0ykg,1510
 job_shop_lib/dispatching/_dispatcher.py,sha256=PCSBpYAF6QPXWrjwkBQXTxOdGdq6Y1Uqw8esQTW05TQ,21357
 job_shop_lib/dispatching/_dispatcher_observer_config.py,sha256=l_lbaw9JJ5icVOmDAzAL6G5t6wG25bQLpRedN1bys8c,1932
@@ -16,20 +16,20 @@ job_shop_lib/dispatching/_factories.py,sha256=UAZLq7d_-puzMYteiAbbhkcW5ucKO-lo3b
 job_shop_lib/dispatching/_history_observer.py,sha256=Vl8rQaxekUeEB-AyNxyC3c76zQakeh-rdri2iDnZvXw,610
 job_shop_lib/dispatching/_ready_operation_filters.py,sha256=q8Xv4kp_2GsvEMC5mlTuJXivAz_b8bbrqo5sXaS3PJU,3110
 job_shop_lib/dispatching/_unscheduled_operations_observer.py,sha256=LNEzqOWqEf6fvtkQrDmDWFEhCfA75OgEtzdomzbxYII,2683
-job_shop_lib/dispatching/feature_observers/__init__.py,sha256=oPrhxw65znMhLugMqUD-1swNi8MufejQbHKiMxtgCU0,1103
-job_shop_lib/dispatching/feature_observers/_composite_feature_observer.py,sha256=SqZ7Th97p1SkmHz2O_xdPCoqiPNwEs71n_iSkCO3FQM,6397
-job_shop_lib/dispatching/feature_observers/_duration_observer.py,sha256=RfWXtxXvS4lakIRWPa1tD0I_UGgb7-h4-tTVvA_x4tA,3490
-job_shop_lib/dispatching/feature_observers/_earliest_start_time_observer.py,sha256=iBkfGxG9-peO8shJKTl2P59YFq63aX_Z4XUvOL6m79g,8912
-job_shop_lib/dispatching/feature_observers/_factory.py,sha256=3nlLDzdf_UJqmNO1Om69ygxj-9mF4kfPBp0rFFUC_a0,2773
-job_shop_lib/dispatching/feature_observers/_feature_observer.py,sha256=N-UhOsw3VbasKucuZlAJyF-k0O7CiwtGFez39xOF66Q,5174
-job_shop_lib/dispatching/feature_observers/_is_completed_observer.py,sha256=_ZSmHt1ZtLNXBipaeSOXwgY14WWN3tIm9sx8WY4-zBw,3448
-job_shop_lib/dispatching/feature_observers/_is_ready_observer.py,sha256=iRr2MsCAglb6dO5fhHKSD7Z2ZHRjYqXK7E8bimAfpOY,1244
-job_shop_lib/dispatching/feature_observers/_is_scheduled_observer.py,sha256=PeLxPVLJX_TP4TG8ViEQFR8WS43wIp6CqyuapM8lIt8,1477
-job_shop_lib/dispatching/feature_observers/_position_in_job_observer.py,sha256=hvztjuajYRx-CnmflWqN4lG06pJelZIRZmarjPK9Afo,1107
-job_shop_lib/dispatching/feature_observers/_remaining_operations_observer.py,sha256=kNvRVbxsx5SI2nMc9ZbmcPd5wDaxiljhkXpk6biV2rI,1442
+job_shop_lib/dispatching/feature_observers/__init__.py,sha256=EuJLvSpJpoXUK8A4UuC2k6Mpa293ZR3oCnnvYivIBtU,2240
+job_shop_lib/dispatching/feature_observers/_composite_feature_observer.py,sha256=DOS961MtWaDk2gxjOLA_75SyT6Nmn3IKuNtYO8odk8s,7938
+job_shop_lib/dispatching/feature_observers/_duration_observer.py,sha256=fbkUIVScF1iNjdVCYr1ImQm53TfahvVnGXhsRAsgdzY,4129
+job_shop_lib/dispatching/feature_observers/_earliest_start_time_observer.py,sha256=SOdXs-uzTzcLqOsmpbKvf-OGlGXOMVVJL9zgVVVDvF8,11442
+job_shop_lib/dispatching/feature_observers/_factory.py,sha256=b5YyzdnorijtWUNrYWs4sf-G17eDxw8oYrol1rzMN1Q,2919
+job_shop_lib/dispatching/feature_observers/_feature_observer.py,sha256=crbqG1KrmUOfG4z7shHNzhUg7-uSP4_RWxyOi-RRWmE,8635
+job_shop_lib/dispatching/feature_observers/_is_completed_observer.py,sha256=wKmlASLjodztAB2ypTsi0XFLZ3h1ltzvsa9BpPrbksU,4581
+job_shop_lib/dispatching/feature_observers/_is_ready_observer.py,sha256=KYDUO3Zz1wgkClZ64i5-az6W-SFpi8rckAlv4Zjcii4,1260
+job_shop_lib/dispatching/feature_observers/_is_scheduled_observer.py,sha256=OcuMUB9_By6ZMtX-1_3z-xaxGbP85a5Zv0ywAv7XxWQ,1491
+job_shop_lib/dispatching/feature_observers/_position_in_job_observer.py,sha256=WRknpQBKXs6h6cXLFJW7ZCvjtU8CPL-iXXNPw3g-mLE,1303
+job_shop_lib/dispatching/feature_observers/_remaining_operations_observer.py,sha256=5V87lCrJUabEe8AkTGXPu5yS8OGxeN8L3-xNyHmdmLs,1441
 job_shop_lib/dispatching/rules/__init__.py,sha256=p1rkqf66L62uvAOM1ZxNV8xHoh7SuYjHi_8ZNBvPIjg,1450
 job_shop_lib/dispatching/rules/_dispatching_rule_factory.py,sha256=5fNpv90fAoR6rcE6NeJOWiB7ir-FVnoONIhHtKJ9H0E,2904
-job_shop_lib/dispatching/rules/_dispatching_rule_solver.py,sha256=r-z3AHwbYNRRnrifoz1gmKASpWqxrUQoxvyfara92KM,5331
+job_shop_lib/dispatching/rules/_dispatching_rule_solver.py,sha256=Nb3EPSIdnbeqKaIf5ufE2zxQsNpNkZxmYa0Eh1jnCnw,5537
 job_shop_lib/dispatching/rules/_dispatching_rules_functions.py,sha256=Wb9fQIfePvCJi4RqJ59UrRSnYufgQw5nQ_Am8M6-JOI,7569
 job_shop_lib/dispatching/rules/_machine_chooser_factory.py,sha256=xsJ8nJwPDBi-sfLJRQF_BBQDbyXDfopD1U-efXffQAE,2331
 job_shop_lib/dispatching/rules/_utils.py,sha256=X8vET2p1D3RyoB9mFfsfRgmilcTmxPssKYyJQ2zEt0Q,4605
@@ -38,13 +38,13 @@ job_shop_lib/generation/__init__.py,sha256=hUqjnE0bEoknuUwFoLUWjBH26qTTCGsJAW4gs
 job_shop_lib/generation/_general_instance_generator.py,sha256=8DG70qT2TUTyPp-3Q1DHWo3DhtUvyB4Yo_u0eAa5CIc,7431
 job_shop_lib/generation/_instance_generator.py,sha256=fPcbNoyk0t1JtJpBMiwk3SlyPkWYNkYS7-Vs8qH_eDM,4642
 job_shop_lib/generation/_transformations.py,sha256=FI2qHrETATJUrQP3-RYhZAQ5boyEZ0CF2StDbacBej8,5290
-job_shop_lib/graphs/__init__.py,sha256=Kzw__atE5q_bbLf-vDwqya453RP-CfgV7RlURbdOfSc,1646
-job_shop_lib/graphs/_build_agent_task_graph.py,sha256=ktj-oNLUPmWHfL81EVyaoF4hXClWYfnN7oG2Nn4pOsg,7128
+job_shop_lib/graphs/__init__.py,sha256=ALZNmvCi5XveMneVJ2VQpQ5msYwIqFWFloiwyFtJhAo,1709
+job_shop_lib/graphs/_build_agent_task_graph.py,sha256=6mvWJ7fFD5CmxkTuXEwY7f_-qxjKdNgFmWk4a4mgiD8,7132
 job_shop_lib/graphs/_build_disjunctive_graph.py,sha256=z1jiuTTaWPJZj-vSZdo064quGx4LEDKjtZIb1FieZW4,3705
-job_shop_lib/graphs/_constants.py,sha256=dqPF--okue5sF70Iv-YR14QKFx4pxPwT2dL1Rh5jylM,374
-job_shop_lib/graphs/_job_shop_graph.py,sha256=QmYj-DptmV3Mca0JHplPa1YPt6D4zDSdIwclKK15Ib0,9938
-job_shop_lib/graphs/_node.py,sha256=FcV92cH1RK6xv8qK3d4QaCRzB-C2kY0MtVeWNgsdi6U,5769
-job_shop_lib/graphs/graph_updaters/__init__.py,sha256=utejVUdKNa3g_6HpfTKanv-9K9sVFlRnqhWpRPGxEHU,358
+job_shop_lib/graphs/_constants.py,sha256=K-GeVvh_DTWpo1KOX1clmxWS_pkUJbq19yOBmrCVIxI,1086
+job_shop_lib/graphs/_job_shop_graph.py,sha256=Fv0TOwtmjqdhH-A_TBH0wSzQkGgqTyc7vvEcfzbQiwA,10681
+job_shop_lib/graphs/_node.py,sha256=hGgdnD9wlsTbkaDizFZMsxPXa2-m91iBNLu0vtkVbxw,6034
+job_shop_lib/graphs/graph_updaters/__init__.py,sha256=UhnZL55e3cAv7hVetB6bRmIOn8BDhG2bsbrdRoHtxLY,516
 job_shop_lib/graphs/graph_updaters/_graph_updater.py,sha256=H8PtBj4gv6y5wQKOstF2CSnLsFjO1YeVHpzvYK3vMRM,2053
 job_shop_lib/graphs/graph_updaters/_residual_graph_updater.py,sha256=kPuBmion70-GAQsyFal8gHylHvZSoBJae9eF8iGOkvA,6097
 job_shop_lib/graphs/graph_updaters/_utils.py,sha256=X5YfwJA1CCgpm1r9C036Gal2CkDh2SSak7wl7TbdjHw,704
@@ -59,8 +59,8 @@ job_shop_lib/visualization/_agent_task_graph.py,sha256=AaBTD_S34WjrsZnL_iMAplR_f
 job_shop_lib/visualization/_disjunctive_graph.py,sha256=pg4KG9BfQbnBPnXYgbyPGe0AuHSmhYqPeqWYAf_spWQ,5905
 job_shop_lib/visualization/_gantt_chart.py,sha256=B9sn4XrEUqgQhRKju-1VUG5R67AZXRu7jbrtA8VcndU,4412
 job_shop_lib/visualization/_gantt_chart_creator.py,sha256=qFhCfk3oC3uF7Mau3lrNhH-34sfHXvkqEXbsDzrIbBk,7721
-job_shop_lib/visualization/_gantt_chart_video_and_gif_creation.py,sha256=XXRLpC05E3zY4SIytdFP2QuxmGA95VohUVmzoFzEt7Q,13206
-job_shop_lib-1.0.0a1.dist-info/LICENSE,sha256=9mggivMGd5taAu3xbmBway-VQZMBzurBGHofFopvUsQ,1069
-job_shop_lib-1.0.0a1.dist-info/METADATA,sha256=h5mdFHRaXbnL7F4lMjGNVE5-TSx35rvAG8SlzX3wWiU,14810
-job_shop_lib-1.0.0a1.dist-info/WHEEL,sha256=FMvqSimYX_P7y0a7UY-_Mc83r5zkBZsCYPm7Lr0Bsq4,88
-job_shop_lib-1.0.0a1.dist-info/RECORD,,
+job_shop_lib/visualization/_gantt_chart_video_and_gif_creation.py,sha256=GQhQF2YzSRQT_DdUjJYHFKMZMjk_hPrYjQU5PpedNvs,13213
+job_shop_lib-1.0.0a2.dist-info/LICENSE,sha256=9mggivMGd5taAu3xbmBway-VQZMBzurBGHofFopvUsQ,1069
+job_shop_lib-1.0.0a2.dist-info/METADATA,sha256=IVDNFeNtFCpjUzIGXkEn0uQ3aBgJLSLXHuJKEgpBajI,14810
+job_shop_lib-1.0.0a2.dist-info/WHEEL,sha256=FMvqSimYX_P7y0a7UY-_Mc83r5zkBZsCYPm7Lr0Bsq4,88
+job_shop_lib-1.0.0a2.dist-info/RECORD,,