job-shop-lib 1.0.0b1__py3-none-any.whl → 1.0.0b3__py3-none-any.whl

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.0.0-b.1"
+__version__ = "1.0.0-b.3"
 
 __all__ = [
     "Operation",

job_shop_lib/dispatching/__init__.py

@@ -8,6 +8,7 @@ Problem step-by-step.
     DispatcherObserver
     HistoryObserver
     UnscheduledOperationsObserver
+    OptimalOperationsObserver
     ReadyOperationsFilter
     DispatcherObserverConfig
     filter_dominated_operations
@@ -25,9 +26,8 @@ from ._dispatcher import Dispatcher, DispatcherObserver
 from ._history_observer import (
     HistoryObserver,
 )
-from ._unscheduled_operations_observer import (
-    UnscheduledOperationsObserver,
-)
+from ._unscheduled_operations_observer import UnscheduledOperationsObserver
+from ._optimal_operations_observer import OptimalOperationsObserver
 from ._ready_operation_filters import (
     filter_dominated_operations,
     filter_non_immediate_machines,
@@ -57,4 +57,5 @@ __all__ = [
     "ReadyOperationsFilter",
     "filter_non_idle_machines",
     "filter_non_immediate_operations",
+    "OptimalOperationsObserver",
 ]

job_shop_lib/dispatching/_optimal_operations_observer.py

@@ -0,0 +1,115 @@
+"""Home of the `OptimalOperationsObserver` class."""
+
+from typing import List, Set, Dict
+from job_shop_lib.dispatching import DispatcherObserver, Dispatcher
+from job_shop_lib import Schedule, Operation, ScheduledOperation
+from job_shop_lib.exceptions import ValidationError
+
+
+class OptimalOperationsObserver(DispatcherObserver):
+    """Observer that identifies which available operations are optimal based on
+    a reference schedule.
+
+    This observer compares the available operations at each step with a
+    reference schedule to determine which operations would lead to the optimal
+    solution. It can be used for training purposes or to analyze decision
+    making in dispatching algorithms.
+
+    Attributes:
+        optimal_operations: Set of operations that are considered optimal
+            based on the reference schedule.
+        reference_schedule: The reference schedule used to determine optimal
+            operations.
+        _operation_to_scheduled: Dictionary mapping operations to their
+            scheduled versions in the reference schedule.
+
+    Args:
+        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.
+
+    Raises:
+        ValidationError: If the reference schedule is incomplete or if it
+            doesn't match the dispatcher's instance.
+    """
+
+    _is_singleton = False
+
+    def __init__(
+        self,
+        dispatcher: Dispatcher,
+        reference_schedule: Schedule,
+        *,
+        subscribe: bool = True,
+    ):
+        super().__init__(dispatcher, subscribe=subscribe)
+
+        if not reference_schedule.is_complete():
+            raise ValidationError("Reference schedule must be complete.")
+
+        if reference_schedule.instance != dispatcher.instance:
+            raise ValidationError(
+                "Reference schedule instance does not match dispatcher "
+                "instance."
+            )
+
+        self.reference_schedule = reference_schedule
+        self.optimal_available: Set[Operation] = set()
+        self._operation_to_scheduled: Dict[Operation, ScheduledOperation] = {}
+        self._machine_next_operation_index: List[int] = [0] * len(
+            reference_schedule.schedule
+        )
+
+        self._build_operation_mapping()
+        self._update_optimal_operations()
+
+    def _build_operation_mapping(self) -> None:
+        """Builds a mapping from operations to their scheduled versions in
+        the reference schedule."""
+        for machine_schedule in self.reference_schedule.schedule:
+            for scheduled_op in machine_schedule:
+                self._operation_to_scheduled[scheduled_op.operation] = (
+                    scheduled_op
+                )
+
+    def _update_optimal_operations(self) -> None:
+        """Updates the set of optimal operations based on current state.
+
+        An operation is considered optimal if it is the next unscheduled
+        operation in its machine's sequence according to the reference
+        schedule.
+        """
+        self.optimal_available.clear()
+        available_operations = self.dispatcher.available_operations()
+
+        if not available_operations:
+            return
+
+        for operation in available_operations:
+            scheduled_op = self._operation_to_scheduled[operation]
+            machine_index = scheduled_op.machine_id
+            next_index = self._machine_next_operation_index[machine_index]
+
+            if (
+                scheduled_op
+                == self.reference_schedule.schedule[machine_index][next_index]
+            ):
+                self.optimal_available.add(operation)
+
+    def update(self, scheduled_operation: ScheduledOperation) -> None:
+        """Updates the optimal operations after an operation is scheduled.
+
+        Args:
+            scheduled_operation: The operation that was just scheduled.
+        """
+        self._machine_next_operation_index[scheduled_operation.machine_id] += 1
+        self._update_optimal_operations()
+
+    def reset(self) -> None:
+        """Resets the observer to its initial state."""
+        self._machine_next_operation_index = [0] * len(
+            self.dispatcher.schedule.schedule
+        )
+        self.optimal_available.clear()
+        self._update_optimal_operations()

job_shop_lib/dispatching/rules/__init__.py

@@ -1,4 +1,40 @@
-"""Contains the dispatching rules for the job shop scheduling problem."""
+"""Contains the dispatching rules for the job shop scheduling problem.
+
+Main objects:
+
+.. autosummary::
+
+    DispatchingRuleSolver
+    dispatching_rule_factory
+    DispatchingRuleType
+    MachineChooserType
+    dispatching_rule_factory
+    machine_chooser_factory
+
+Dispatching rules:
+
+.. autosummary::
+
+    shortest_processing_time_rule
+    first_come_first_served_rule
+    most_work_remaining_rule
+    most_operations_remaining_rule
+    random_operation_rule
+    score_based_rule
+    score_based_rule_with_tie_breaker
+    observer_based_most_work_remaining_rule
+
+Dispatching rule scorers:
+
+.. autosummary::
+
+    shortest_processing_time_score
+    first_come_first_served_score
+    MostWorkRemainingScorer
+    most_operations_remaining_score
+    random_score
+
+"""
 
 from ._dispatching_rules_functions import (
     shortest_processing_time_rule,

job_shop_lib/dispatching/rules/_dispatching_rule_solver.py

@@ -30,14 +30,14 @@ class DispatchingRuleSolver(BaseSolver):
             Used to choose the machine where the operation will be dispatched
             to. It is only used if the operation can be dispatched to multiple
             machines.
-        pruning_function:
-            The pruning function to use. It is used to initialize the
+        ready_operations_filter:
+            The ready operations filter to use. It is used to initialize the
             dispatcher object internally when calling the solve method.
 
     Args:
         dispatching_rule:
             The dispatching rule to use. It can be a string with the name
-            of the dispatching rule, a class`DispatchingRuleType` enum member,
+            of the dispatching rule, a :class:`DispatchingRuleType` member,
             or a callable that takes a dispatcher and returns the operation to
             be dispatched next.
         machine_chooser:
@@ -110,8 +110,30 @@ class DispatchingRuleSolver(BaseSolver):
         instance: JobShopInstance,
         dispatcher: Optional[Dispatcher] = None,
     ) -> Schedule:
-        """Returns a schedule for the given job shop instance using the
-        dispatching rule algorithm."""
+        """Solves the instance using the dispatching rule and machine chooser
+        algorithms.
+
+        Args:
+            instance:
+                The job shop instance to be solved.
+            dispatcher:
+                The dispatcher object that will be used to dispatch the
+                operations. If not provided, a new dispatcher will be created
+                using the ready operations filter provided in the constructor.
+
+        Returns:
+            The schedule obtained after solving the instance.
+
+        .. tip::
+            Another way to use the solver is by calling it as a function. This
+            will call the ``solve`` method internally and will add metadata to
+            the schedule. For example:
+
+            .. code-block:: python
+
+                solver = DispatchingRuleSolver()
+                schedule = solver(instance)
+        """
         if dispatcher is None:
             dispatcher = Dispatcher(
                 instance, ready_operations_filter=self.ready_operations_filter

job_shop_lib/graphs/__init__.py

@@ -8,9 +8,9 @@ The main classes and functions available in this package are:
     NodeType
     build_disjunctive_graph
     build_solved_disjunctive_graph
-    build_agent_task_graph
-    build_complete_agent_task_graph
-    build_agent_task_graph_with_jobs
+    build_resource_task_graph
+    build_complete_resource_task_graph
+    build_resource_task_graph_with_jobs
 
 """
 

job_shop_lib/reinforcement_learning/__init__.py

@@ -12,6 +12,7 @@
     IdleTimeReward
     RenderConfig
     add_padding
+    create_edge_type_dict
 
 """
 
@@ -27,7 +28,10 @@ from job_shop_lib.reinforcement_learning._reward_observers import (
     IdleTimeReward,
 )
 
-from job_shop_lib.reinforcement_learning._utils import add_padding
+from job_shop_lib.reinforcement_learning._utils import (
+    add_padding,
+    create_edge_type_dict,
+)
 
 from job_shop_lib.reinforcement_learning._single_job_shop_graph_env import (
     SingleJobShopGraphEnv,
@@ -47,4 +51,5 @@ __all__ = [
     "ObservationDict",
     "add_padding",
     "MultiJobShopGraphEnv",
+    "create_edge_type_dict",
 ]

job_shop_lib/reinforcement_learning/_utils.py

@@ -1,6 +1,6 @@
 """Utility functions for reinforcement learning."""
 
-from typing import TypeVar, Any, Tuple, Optional, Type
+from typing import TypeVar, Any, Type, Literal
 
 import numpy as np
 from numpy.typing import NDArray
@@ -12,9 +12,9 @@ T = TypeVar("T", bound=np.number)
 
 def add_padding(
     array: NDArray[Any],
-    output_shape: Tuple[int, ...],
+    output_shape: tuple[int, ...],
     padding_value: float = -1,
-    dtype: Optional[Type[T]] = None,
+    dtype: Type[T] | None = None,
 ) -> NDArray[T]:
     """Adds padding to the array.
 
@@ -90,6 +90,42 @@ def add_padding(
     return padded_array
 
 
+def create_edge_type_dict(
+    edge_index: NDArray[T], type_ranges: dict[str, tuple[int, int]]
+) -> dict[tuple[str, Literal["to"], str], NDArray[T]]:
+    """Organizes edges based on node types.
+
+    Args:
+        edge_index:
+            numpy array of shape (2, E) where E is number of edges
+        type_ranges: dict[str, tuple[int, int]]
+            Dictionary mapping type names to their corresponding index ranges
+            [start, end) in the ``edge_index`` array.
+
+    Returns:
+        A dictionary with keys (type_i, "to", type_j) and values as edge
+        indices
+    """
+    edge_index_dict: dict[tuple[str, Literal["to"], str], NDArray] = {}
+    for type_name_i, (start_i, end_i) in type_ranges.items():
+        for type_name_j, (start_j, end_j) in type_ranges.items():
+            key: tuple[str, Literal["to"], str] = (
+                type_name_i,
+                "to",
+                type_name_j,
+            )
+            # Find edges where source is in type_i and target is in type_j
+            mask = (
+                (edge_index[0] >= start_i)
+                & (edge_index[0] < end_i)
+                & (edge_index[1] >= start_j)
+                & (edge_index[1] < end_j)
+            )
+            edge_index_dict[key] = edge_index[:, mask]
+
+    return edge_index_dict
+
+
 if __name__ == "__main__":
     import doctest
 

job_shop_lib/visualization/graphs/__init__.py

@@ -3,7 +3,7 @@
 .. autosummary::
 
     plot_disjunctive_graph
-    plot_heterogeneous_graph
+    plot_resource_task_graph
     three_columns_layout
     duration_labeler
     color_nodes_by_machine

{job_shop_lib-1.0.0b1.dist-info → job_shop_lib-1.0.0b3.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: job-shop-lib
-Version: 1.0.0b1
+Version: 1.0.0b3
 Summary: An easy-to-use and modular Python library for the Job Shop Scheduling Problem (JSSP)
 License: MIT
 Author: Pabloo22
@@ -57,10 +57,10 @@ pip install job-shop-lib
 See [this](https://colab.research.google.com/drive/1XV_Rvq1F2ns6DFG8uNj66q_rcowwTZ4H?usp=sharing) Google Colab notebook for a quick start guide! 
 
 
-Version 1.0.0 is currently in alpha stage and can be installed with:
+Version 1.0.0 is currently in beta stage and can be installed with:
 
 ```bash
-pip install job-shop-lib==1.0.0b1
+pip install job-shop-lib==1.0.0b3
 ```
 
 Although this version is not stable and may contain breaking changes in subsequent releases, it is recommended to install it to access the new reinforcement learning environments and familiarize yourself with new changes (see the [latest pull requests](https://github.com/Pabloo22/job_shop_lib/pulls?q=is%3Apr+is%3Aclosed)). There is a [documentation page](https://job-shop-lib.readthedocs.io/en/latest/) for versions 1.0.0a3 and onward.

{job_shop_lib-1.0.0b1.dist-info → job_shop_lib-1.0.0b3.dist-info}/RECORD

@@ -1,4 +1,4 @@
-job_shop_lib/__init__.py,sha256=Mmft9aghnnkZhxx6ZlwsvTx5PjSziJeWgNeDrMoftSY,643
+job_shop_lib/__init__.py,sha256=fj4EeaNf1NTAbpB0EH9OnhS_MjP1MCe03Xr6JNrLC_g,643
 job_shop_lib/_base_solver.py,sha256=p17XmtufNc9Y481cqZUT45pEkUmmW1HWG53dfhIBJH8,1363
 job_shop_lib/_job_shop_instance.py,sha256=hNQGSJj0rEQpS-YhzwWmM6QzCWp6r--89jkghSgLvUs,18380
 job_shop_lib/_operation.py,sha256=hx2atpP8LPj9fvxpZIfhBFr9Uq6JP-MKAX5JzTvFXso,3847
@@ -9,11 +9,12 @@ job_shop_lib/benchmarking/_load_benchmark.py,sha256=Jb6HYGKkub-3uU3l3NreRPE0PU6f
 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=vz_Kg_CmvZ13yGgqi-hZuFkosJR1v449xNaAZV3PhsE,10501
-job_shop_lib/dispatching/__init__.py,sha256=2VQYWNSyuDx3zzrDPCEzs5VJd2AIJvF7vA7LwK5z2V4,1648
+job_shop_lib/dispatching/__init__.py,sha256=SXVd0Zh6xTp-lNT7c463pii3l168NCZYf-5uOwBI1Fc,1770
 job_shop_lib/dispatching/_dispatcher.py,sha256=HW333xJoupufSUCg-pfaR_4KoQHjQMd4SBXJj-vgE7Y,22349
 job_shop_lib/dispatching/_dispatcher_observer_config.py,sha256=RaUkLxYCHG8Tx2tPgFyOBa8FAcbREZdKuTyLsyaYvhA,2473
 job_shop_lib/dispatching/_factories.py,sha256=1McCm3iJGdGDZerAe6MTWsthpbomuYb3crTKg_5lfyM,4678
 job_shop_lib/dispatching/_history_observer.py,sha256=dixJe83quzGNwG0u0k2uES7GsLw0zWCjX0MOUD4VTRU,634
+job_shop_lib/dispatching/_optimal_operations_observer.py,sha256=HTbmc9EaagM3UA6IIUaj7O0Fq3hCrjONhfonHIZnCE0,4376
 job_shop_lib/dispatching/_ready_operation_filters.py,sha256=H2-CPL0BKDvpLM2zvDGr9eC849qLgbxsVDHgPAHtNgc,5754
 job_shop_lib/dispatching/_unscheduled_operations_observer.py,sha256=3E0ePesDdWdNs6520znnOBW3eiegJj5bZg9Tmb0xoSA,2705
 job_shop_lib/dispatching/feature_observers/__init__.py,sha256=EuJLvSpJpoXUK8A4UuC2k6Mpa293ZR3oCnnvYivIBtU,2240
@@ -27,9 +28,9 @@ job_shop_lib/dispatching/feature_observers/_is_ready_observer.py,sha256=aP5CpwmC
 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/__init__.py,sha256=g3PGvMLMa3WMgNhGSW3S_xkHqoHpW8hr_9JqOfR7Xrk,2140
 job_shop_lib/dispatching/rules/_dispatching_rule_factory.py,sha256=0Hht2i_aGS5hgwPxh_59-ZtNQxgSOwEFclukXH6Ib9U,2942
-job_shop_lib/dispatching/rules/_dispatching_rule_solver.py,sha256=uvUtlcV4kg4XXu63MRHOWEg-QBMjRLE2G425-fyVPgE,6544
+job_shop_lib/dispatching/rules/_dispatching_rule_solver.py,sha256=9-UE0HiHCeFXFGqB85cSfduLCEm5k5bJkmIujP-_irg,7321
 job_shop_lib/dispatching/rules/_dispatching_rules_functions.py,sha256=wfBdiKqEQQ8C5Gg_mrWWSuWncPwUkFacjeAQ8D4n9Wc,7648
 job_shop_lib/dispatching/rules/_machine_chooser_factory.py,sha256=QqYXQr7Cp6WsqhLa1oHvR1vnbG8IFmYvxM44dQeLeSE,2362
 job_shop_lib/dispatching/rules/_utils.py,sha256=DFDpRoHb56Rtn01vfN69Bq0X3F8P1EtM6trHx9aXg3U,4643
@@ -39,7 +40,7 @@ job_shop_lib/generation/_general_instance_generator.py,sha256=e-NDkH-NoCwa14oADj
 job_shop_lib/generation/_instance_generator.py,sha256=VV0OKX4JgFq3I1EY6s3LrOdPjM3v4lH6S1hkUebTkFQ,4615
 job_shop_lib/generation/_transformations.py,sha256=X-hTAJVIHZ3bmF1rqS0zCit8r5SGpHpV8Fcl92fejow,5336
 job_shop_lib/generation/_utils.py,sha256=cBhGILE0FE3TqvWoHqpaFEffO8D2fb869pF-BdMlYsg,3617
-job_shop_lib/graphs/__init__.py,sha256=zw4aOE-7QF8Lt8316rCUwOEAGqznjiijumTlGqBmfuw,1840
+job_shop_lib/graphs/__init__.py,sha256=RI9vGUR_89X34UoHpl1HYZpxT8JOWg8dwZTe5ImDCVg,1849
 job_shop_lib/graphs/_build_disjunctive_graph.py,sha256=UbUYdeQaaeEqLchcKJGHEFGl4wElfGLb1o_R-u8wqnA,5120
 job_shop_lib/graphs/_build_resource_task_graphs.py,sha256=GHUHkUNPxVf1miScgPPMe2YqlXFEMxIy5cDhNw7OZ1E,6954
 job_shop_lib/graphs/_constants.py,sha256=K-GeVvh_DTWpo1KOX1clmxWS_pkUJbq19yOBmrCVIxI,1086
@@ -49,21 +50,21 @@ job_shop_lib/graphs/graph_updaters/__init__.py,sha256=UhnZL55e3cAv7hVetB6bRmIOn8
 job_shop_lib/graphs/graph_updaters/_graph_updater.py,sha256=j1f7iWsa62GVszK2BPaMxnKBCEGWa9owm8g4VWUje8w,1967
 job_shop_lib/graphs/graph_updaters/_residual_graph_updater.py,sha256=SfgmDyMwfW56OBjJPaU76c42IsX5qx9j-eMtrv0DjKk,6047
 job_shop_lib/graphs/graph_updaters/_utils.py,sha256=X5YfwJA1CCgpm1r9C036Gal2CkDh2SSak7wl7TbdjHw,704
-job_shop_lib/reinforcement_learning/__init__.py,sha256=gOY-C6BMeFr3084MKMMbW0CoK7gMsaOYNsgnYuepswQ,1033
+job_shop_lib/reinforcement_learning/__init__.py,sha256=IohAO2-eAdgeAsNG2czRhI5Eu9jKPnDnB8Z-ne_L1as,1124
 job_shop_lib/reinforcement_learning/_multi_job_shop_graph_env.py,sha256=ib1Y6cItVvId4PfesiQ0XKbh9y6h8LVhD0gYDO4wSlk,15732
 job_shop_lib/reinforcement_learning/_reward_observers.py,sha256=iWHccnujeAKyTQn2ilQ4BhcEccoSTyJqQ5yOiP5GG_Y,2984
 job_shop_lib/reinforcement_learning/_single_job_shop_graph_env.py,sha256=DZnXeXmzMGKq-vwFhxukmSDN1UyrkUfbnjpjFtC9_Bs,15845
 job_shop_lib/reinforcement_learning/_types_and_constants.py,sha256=xozdM_Wabdbe9e1a769p5980OSNBwQqc9yyaSGW2ODQ,1743
-job_shop_lib/reinforcement_learning/_utils.py,sha256=ksg2ghSncxd0K3AR5hGS5PQejjd-Hgx6LGtXX_oatOc,2523
+job_shop_lib/reinforcement_learning/_utils.py,sha256=PZWUZVc_Du90PYvKeTxe0dLkCuK3KwQ3D5I54kk5x0U,3808
 job_shop_lib/visualization/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 job_shop_lib/visualization/gantt/__init__.py,sha256=HGXwRgDuMAldqU0JBdiZCd5e79XBz1r96qHeDVlzE54,1145
 job_shop_lib/visualization/gantt/_gantt_chart_creator.py,sha256=LTsVhpB1Fb_2o08HRZPPXSekwzR7fyTSC6h549XMqhU,8638
 job_shop_lib/visualization/gantt/_gantt_chart_video_and_gif_creation.py,sha256=CcHcvafYrTy7UaScM_wp9QlLOgKiTIKV7tFkttMgoLU,14474
 job_shop_lib/visualization/gantt/_plot_gantt_chart.py,sha256=9-NSSNsVcW8gYLZtAuFeYURqi8cHNkVYufosKtbKFOI,6881
-job_shop_lib/visualization/graphs/__init__.py,sha256=1kytwxBYwmf8ydPK74W07UT6F7gUHFy9sYPfloF0FqY,611
+job_shop_lib/visualization/graphs/__init__.py,sha256=282hZFg07EyQu4HVt4GzFfYnY6ZF376IMjnWZ5eg0ZQ,611
 job_shop_lib/visualization/graphs/_plot_disjunctive_graph.py,sha256=4VBMYiFXXkCGSnGYN9iqNtWrbLJQxAMHojPHhAbdA0s,14387
 job_shop_lib/visualization/graphs/_plot_resource_task_graph.py,sha256=RgJqHS5hJh3KkyaLbtpG_bER981BFRwGpflz7I7gS64,13271
-job_shop_lib-1.0.0b1.dist-info/LICENSE,sha256=9mggivMGd5taAu3xbmBway-VQZMBzurBGHofFopvUsQ,1069
-job_shop_lib-1.0.0b1.dist-info/METADATA,sha256=4HxsMEuSzkSdZDeMWbaMEd0M-QB3iEAoJ6e_t18ZdBc,16425
-job_shop_lib-1.0.0b1.dist-info/WHEEL,sha256=sP946D7jFCHeNz5Iq4fL4Lu-PrWrFsgfLXbbkciIZwg,88
-job_shop_lib-1.0.0b1.dist-info/RECORD,,
+job_shop_lib-1.0.0b3.dist-info/LICENSE,sha256=9mggivMGd5taAu3xbmBway-VQZMBzurBGHofFopvUsQ,1069
+job_shop_lib-1.0.0b3.dist-info/METADATA,sha256=m-NzkaDXbblEXE7O-iQEYOdQQCPDvj6LiRcJKqenpHg,16424
+job_shop_lib-1.0.0b3.dist-info/WHEEL,sha256=sP946D7jFCHeNz5Iq4fL4Lu-PrWrFsgfLXbbkciIZwg,88
+job_shop_lib-1.0.0b3.dist-info/RECORD,,