job-shop-lib 0.3.0__py3-none-any.whl → 0.5.0__py3-none-any.whl

job_shop_lib/job_shop_instance.py

@@ -6,6 +6,8 @@ import os
 import functools
 from typing import Any
 
+import numpy as np
+
 from job_shop_lib import Operation
 
 
@@ -264,6 +266,58 @@ class JobShopInstance:
             [operation.machine_id for operation in job] for job in self.jobs
         ]
 
+    @functools.cached_property
+    def durations_matrix_array(self) -> np.ndarray:
+        """Returns the duration matrix of the instance as a numpy array.
+
+        The returned array has shape (num_jobs, max_num_operations_per_job).
+        Non-existing operations are filled with np.nan.
+
+        Example:
+            >>> jobs = [[Operation(0, 2), Operation(1, 3)], [Operation(0, 4)]]
+            >>> instance = JobShopInstance(jobs)
+            >>> instance.durations_matrix_array
+            array([[ 2.,  2.],
+                   [ 4., nan]], dtype=float32)
+        """
+        duration_matrix = self.durations_matrix
+        return self._fill_matrix_with_nans_2d(duration_matrix)
+
+    @functools.cached_property
+    def machines_matrix_array(self) -> np.ndarray:
+        """Returns the machines matrix of the instance as a numpy array.
+
+        The returned array has shape (num_jobs, max_num_operations_per_job,
+        max_num_machines_per_operation). Non-existing machines are filled with
+        np.nan.
+
+        Example:
+            >>> jobs = [
+            ...     [Operation(machines=[0, 1], 2), Operation(machines=1, 3)],
+            ...     [Operation(machines=0, 6)],
+            ... ]
+            >>> instance = JobShopInstance(jobs)
+            >>> instance.machines_matrix_array
+            array([[[ 0.,  1.],
+                    [ 1., nan]],
+                   [[ 0., nan],
+                    [nan, nan]]], dtype=float32)
+        """
+
+        machines_matrix = self.machines_matrix
+        if self.is_flexible:
+            # False positive from mypy, the type of machines_matrix is
+            # list[list[list[int]]] here
+            return self._fill_matrix_with_nans_3d(
+                machines_matrix  # type: ignore[arg-type]
+            )
+
+        # False positive from mypy, the type of machines_matrix is
+        # list[list[int]] here
+        return self._fill_matrix_with_nans_2d(
+            machines_matrix  # type: ignore[arg-type]
+        )
+
     @functools.cached_property
     def operations_by_machine(self) -> list[list[Operation]]:
         """Returns a list of lists of operations.
@@ -353,3 +407,50 @@ class JobShopInstance:
     def total_duration(self) -> int:
         """Returns the sum of the durations of all operations in all jobs."""
         return sum(self.job_durations)
+
+    @staticmethod
+    def _fill_matrix_with_nans_2d(matrix: list[list[int]]) -> np.ndarray:
+        """Fills a matrix with np.nan values.
+
+        Args:
+            matrix:
+                A list of lists of integers.
+
+        Returns:
+            A numpy array with the same shape as the input matrix, filled with
+            np.nan values.
+        """
+        max_length = max(len(row) for row in matrix)
+        squared_matrix = np.full(
+            (len(matrix), max_length), np.nan, dtype=np.float32
+        )
+        for i, row in enumerate(matrix):
+            squared_matrix[i, : len(row)] = row
+        return squared_matrix
+
+    @staticmethod
+    def _fill_matrix_with_nans_3d(matrix: list[list[list[int]]]) -> np.ndarray:
+        """Fills a 3D matrix with np.nan values.
+
+        Args:
+            matrix:
+                A list of lists of lists of integers.
+
+        Returns:
+            A numpy array with the same shape as the input matrix, filled with
+            np.nan values.
+        """
+        max_length = max(len(row) for row in matrix)
+        max_inner_length = len(matrix[0][0])
+        for row in matrix:
+            for inner_row in row:
+                max_inner_length = max(max_inner_length, len(inner_row))
+        squared_matrix = np.full(
+            (len(matrix), max_length, max_inner_length),
+            np.nan,
+            dtype=np.float32,
+        )
+        for i, row in enumerate(matrix):
+            for j, inner_row in enumerate(row):
+                squared_matrix[i, j, : len(inner_row)] = inner_row
+        return squared_matrix

job_shop_lib/operation.py

@@ -107,10 +107,10 @@ class Operation:
     def __hash__(self) -> int:
         return hash(self.operation_id)
 
-    def __eq__(self, __value: object) -> bool:
-        if isinstance(__value, Operation):
-            return self.operation_id == __value.operation_id
-        return False
+    def __eq__(self, value: object) -> bool:
+        if not isinstance(value, Operation):
+            return False
+        return self.__slots__ == value.__slots__
 
     def __repr__(self) -> str:
         machines = (

job_shop_lib/schedule.py

@@ -1,6 +1,11 @@
 """Home of the `Schedule` class."""
 
-from job_shop_lib import ScheduledOperation, JobShopInstance
+from __future__ import annotations
+
+from typing import Any
+from collections import deque
+
+from job_shop_lib import ScheduledOperation, JobShopInstance, JobShopLibError
 
 
 class Schedule:
@@ -71,6 +76,96 @@ class Schedule:
         """Returns the number of operations that have been scheduled."""
         return sum(len(machine_schedule) for machine_schedule in self.schedule)
 
+    def to_dict(self) -> dict:
+        """Returns a dictionary representation of the schedule.
+
+        This representation is useful for saving the instance to a JSON file.
+
+        Returns:
+            A dictionary representation of the schedule with the following
+            keys:
+                - "instance": A dictionary representation of the instance.
+                - "job_sequences": A list of lists of job ids. Each list of job
+                    ids represents the order of operations on the machine. The
+                    machine that the list corresponds to is determined by the
+                    index of the list.
+                - "metadata": A dictionary with additional information about
+                    the schedule.
+        """
+        job_sequences: list[list[int]] = []
+        for machine_schedule in self.schedule:
+            job_sequences.append(
+                [operation.job_id for operation in machine_schedule]
+            )
+
+        return {
+            "instance": self.instance.to_dict(),
+            "job_sequences": job_sequences,
+            "metadata": self.metadata,
+        }
+
+    @staticmethod
+    def from_dict(
+        instance: dict[str, Any] | JobShopInstance,
+        job_sequences: list[list[int]],
+        metadata: dict[str, Any] | None = None,
+    ) -> Schedule:
+        """Creates a schedule from a dictionary representation."""
+        if isinstance(instance, dict):
+            instance = JobShopInstance.from_matrices(**instance)
+        schedule = Schedule.from_job_sequences(instance, job_sequences)
+        schedule.metadata = metadata if metadata is not None else {}
+        return schedule
+
+    @staticmethod
+    def from_job_sequences(
+        instance: JobShopInstance,
+        job_sequences: list[list[int]],
+    ) -> Schedule:
+        """Creates an active schedule from a list of job sequences.
+
+        An active schedule is the optimal schedule for the given job sequences.
+        In other words, it is not possible to construct another schedule,
+        through changes in the order of processing on the machines, with at
+        least one operation finishing earlier and no operation finishing later.
+
+        Args:
+            instance:
+                The `JobShopInstance` object that the schedule is for.
+            job_sequences:
+                A list of lists of job ids. Each list of job ids represents the
+                order of operations on the machine. The machine that the list
+                corresponds to is determined by the index of the list.
+
+        Returns:
+            A `Schedule` object with the given job sequences.
+        """
+        from job_shop_lib.dispatching import Dispatcher
+
+        dispatcher = Dispatcher(instance)
+        dispatcher.reset()
+        raw_solution_deques = [deque(job_ids) for job_ids in job_sequences]
+
+        while not dispatcher.schedule.is_complete():
+            at_least_one_operation_scheduled = False
+            for machine_id, job_ids in enumerate(raw_solution_deques):
+                if not job_ids:
+                    continue
+                job_id = job_ids[0]
+                operation_index = dispatcher.job_next_operation_index[job_id]
+                operation = instance.jobs[job_id][operation_index]
+                is_ready = dispatcher.is_operation_ready(operation)
+                if is_ready and machine_id in operation.machines:
+                    dispatcher.dispatch(operation, machine_id)
+                    job_ids.popleft()
+                    at_least_one_operation_scheduled = True
+
+            if not at_least_one_operation_scheduled:
+                raise JobShopLibError(
+                    "Invalid job sequences. No valid operation to schedule."
+                )
+        return dispatcher.schedule
+
     def reset(self):
         """Resets the schedule to an empty state."""
         self.schedule = [[] for _ in range(self.instance.num_machines)]

job_shop_lib/scheduled_operation.py

@@ -1,6 +1,8 @@
 """Home of the `ScheduledOperation` class."""
 
-from job_shop_lib import Operation
+from warnings import warn
+
+from job_shop_lib import Operation, JobShopLibError
 
 
 class ScheduledOperation:
@@ -47,7 +49,7 @@ class ScheduledOperation:
     @machine_id.setter
     def machine_id(self, value: int):
         if value not in self.operation.machines:
-            raise ValueError(
+            raise JobShopLibError(
                 f"Operation cannot be scheduled on machine {value}. "
                 f"Valid machines are {self.operation.machines}."
             )
@@ -62,18 +64,28 @@ class ScheduledOperation:
         """
 
         if self.operation.job_id is None:
-            raise ValueError("Operation has no job_id.")
+            raise JobShopLibError("Operation has no job_id.")
         return self.operation.job_id
 
     @property
     def position(self) -> int:
+        """Deprecated. Use `position_in_job` instead."""
+        warn(
+            "The `position` attribute is deprecated. Use `position_in_job` "
+            "instead. It will be removed in version 1.0.0.",
+            DeprecationWarning,
+        )
+        return self.position_in_job
+
+    @property
+    def position_in_job(self) -> int:
         """Returns the position (starting at zero) of the operation in the job.
 
         Raises:
             ValueError: If the operation has no position_in_job.
         """
         if self.operation.position_in_job is None:
-            raise ValueError("Operation has no position.")
+            raise JobShopLibError("Operation has no position.")
         return self.operation.position_in_job
 
     @property
@@ -91,7 +103,7 @@ class ScheduledOperation:
         if not isinstance(value, ScheduledOperation):
             return False
         return (
-            self.operation is value.operation
+            self.operation == value.operation
             and self.start_time == value.start_time
             and self.machine_id == value.machine_id
         )

job_shop_lib/visualization/create_gif.py

@@ -27,7 +27,8 @@ def create_gif(
     instance: JobShopInstance,
     solver: DispatchingRuleSolver,
     plot_function: (
-        Callable[[Schedule, int, list[Operation] | None], Figure] | None
+        Callable[[Schedule, int, list[Operation] | None, int | None], Figure]
+        | None
     ) = None,
     fps: int = 1,
     remove_frames: bool = True,
@@ -80,50 +81,59 @@ def plot_gantt_chart_wrapper(
     title: str | None = None,
     cmap: str = "viridis",
     show_available_operations: bool = False,
-) -> Callable[[Schedule, int, list[Operation] | None], Figure]:
+) -> Callable[[Schedule, int, list[Operation] | None, int | None], Figure]:
     """Returns a function that plots a Gantt chart for an unfinished schedule.
 
     Args:
         title: The title of the Gantt chart.
         cmap: The name of the colormap to use.
+        show_available_operations:
+            Whether to show the available operations in the Gantt chart.
 
     Returns:
         A function that plots a Gantt chart for a schedule. The function takes
-        a `Schedule` object and the makespan of the schedule as input and
-        returns a `Figure` object.
+        the following arguments:
+        - schedule: The schedule to plot.
+        - makespan: The makespan of the schedule.
+        - available_operations: A list of available operations. If None,
+            the available operations are not shown.
+        - current_time: The current time in the schedule. If provided, a
+            red vertical line is plotted at this time.
     """
 
     def plot_function(
         schedule: Schedule,
         makespan: int,
         available_operations: list | None = None,
+        current_time: int | None = None,
     ) -> Figure:
         fig, ax = plot_gantt_chart(
             schedule, title=title, cmap_name=cmap, xlim=makespan
         )
 
-        if not show_available_operations or available_operations is None:
-            return fig
-
-        operations_text = "\n".join(
-            str(operation) for operation in available_operations
-        )
-        text = f"Available operations:\n{operations_text}"
-        # Print the available operations at the bottom right corner
-        # of the Gantt chart
-        fig.text(
-            1.25,
-            0.05,
-            text,
-            ha="right",
-            va="bottom",
-            transform=ax.transAxes,
-            bbox={
-                "facecolor": "white",
-                "alpha": 0.5,
-                "boxstyle": "round,pad=0.5",
-            },
-        )
+        if show_available_operations and available_operations is not None:
+
+            operations_text = "\n".join(
+                str(operation) for operation in available_operations
+            )
+            text = f"Available operations:\n{operations_text}"
+            # Print the available operations at the bottom right corner
+            # of the Gantt chart
+            fig.text(
+                1.25,
+                0.05,
+                text,
+                ha="right",
+                va="bottom",
+                transform=ax.transAxes,
+                bbox={
+                    "facecolor": "white",
+                    "alpha": 0.5,
+                    "boxstyle": "round,pad=0.5",
+                },
+            )
+        if current_time is not None:
+            ax.axvline(current_time, color="red", linestyle="--")
         return fig
 
     return plot_function
@@ -133,7 +143,9 @@ def create_gantt_chart_frames(
     frames_dir: str,
     instance: JobShopInstance,
     solver: DispatchingRuleSolver,
-    plot_function: Callable[[Schedule, int, list[Operation] | None], Figure],
+    plot_function: Callable[
+        [Schedule, int, list[Operation] | None, int | None], Figure
+    ],
     plot_current_time: bool = True,
 ) -> None:
     """Creates frames of the Gantt chart for the schedule being built.
@@ -150,7 +162,8 @@ def create_gantt_chart_frames(
             should take a `Schedule` object and the makespan of the schedule as
             input and return a `Figure` object.
         plot_current_time:
-            Whether to plot a vertical line at the current time."""
+            Whether to plot a vertical line at the current time.
+    """
     dispatcher = Dispatcher(instance, pruning_function=solver.pruning_function)
     history_tracker = HistoryTracker(dispatcher)
     makespan = solver.solve(instance, dispatcher).makespan()
@@ -160,23 +173,19 @@ def create_gantt_chart_frames(
         dispatcher.dispatch(
             scheduled_operation.operation, scheduled_operation.machine_id
         )
+        current_time = (
+            None if not plot_current_time else dispatcher.current_time()
+        )
         fig = plot_function(
             dispatcher.schedule,
             makespan,
             dispatcher.available_operations(),
+            current_time,
         )
-        current_time = (
-            None if not plot_current_time else dispatcher.current_time()
-        )
-        _save_frame(fig, frames_dir, i, current_time)
-
+        _save_frame(fig, frames_dir, i)
 
-def _save_frame(
-    figure: Figure, frames_dir: str, number: int, current_time: int | None
-) -> None:
-    if current_time is not None:
-        figure.gca().axvline(current_time, color="red", linestyle="--")
 
+def _save_frame(figure: Figure, frames_dir: str, number: int) -> None:
     figure.savefig(f"{frames_dir}/frame_{number:02d}.png", bbox_inches="tight")
     plt.close(figure)
 

job_shop_lib/visualization/gantt_chart.py

@@ -65,7 +65,7 @@ def _plot_machine_schedules(
 ) -> dict[int, Patch]:
     """Plots the schedules for each machine."""
     max_job_id = schedule.instance.num_jobs - 1
-    cmap = plt.cm.get_cmap(cmap_name, max_job_id + 1)
+    cmap = plt.get_cmap(cmap_name, max_job_id + 1)
     norm = Normalize(vmin=0, vmax=max_job_id)
     legend_handles = {}
 

{job_shop_lib-0.3.0.dist-info → job_shop_lib-0.5.0.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: job-shop-lib
-Version: 0.3.0
+Version: 0.5.0
 Summary: An easy-to-use and modular Python library for the Job Shop Scheduling Problem (JSSP)
 License: MIT
 Author: Pabloo22
@@ -15,7 +15,8 @@ Provides-Extra: pygraphviz
 Requires-Dist: imageio (>=2,<3)
 Requires-Dist: matplotlib (>=3,<4)
 Requires-Dist: networkx (>=3,<4)
-Requires-Dist: ortools (>=9,<10)
+Requires-Dist: numpy (>=1.26.4,<2.0.0)
+Requires-Dist: ortools (>=9.9,<9.10)
 Requires-Dist: pyarrow (>=15.0.0,<16.0.0)
 Requires-Dist: pygraphviz (>=1.12,<2.0) ; extra == "pygraphviz"
 Description-Content-Type: text/markdown
@@ -83,7 +84,7 @@ ft06 = load_benchmark_instance("ft06")
 ```
 
 The module `benchmarks` contains functions to load the instances from the file and return them as `JobShopInstance` objects without having to download them
-manually. The instances are stored in [benchmark_instances.json](job_shop_lib/benchmarks/benchmark_instances.json).
+manually.
 
 The contributions to this benchmark dataset are as follows:
 
@@ -171,13 +172,15 @@ class DispatchingRule(str, Enum):
 We can visualize the solution with a `DispatchingRuleSolver` as a gif:
 
 ```python
-from job_shop_lib.visualization import create_gif, get_plot_function
+from job_shop_lib.visualization import create_gif, plot_gantt_chart_wrapper
 from job_shop_lib.dispatching import DispatchingRuleSolver, DispatchingRule
 
 plt.style.use("ggplot")
 
 mwkr_solver = DispatchingRuleSolver("most_work_remaining")
-plot_function = get_plot_function(title="Solution with Most Work Remaining Rule")
+plot_function = plot_gantt_chart_wrapper(
+    title="Solution with Most Work Remaining Rule"
+)
 create_gif(
     gif_path="ft06_optimized.gif",
     instance=ft06,
@@ -350,3 +353,4 @@ This project is licensed under the MIT License - see the [LICENSE](LICENSE) file
      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. 
+

{job_shop_lib-0.3.0.dist-info → job_shop_lib-0.5.0.dist-info}/RECORD

@@ -6,10 +6,21 @@ job_shop_lib/benchmarking/load_benchmark.py,sha256=CjiSALutgWcfD-SDU6w9WO3udvPVp
 job_shop_lib/cp_sat/__init__.py,sha256=DqrF9IewFMkVB5BhFOHhlJvG6w6BW4ecxBXySunGLoU,97
 job_shop_lib/cp_sat/ortools_solver.py,sha256=zsISUQy0dQvn7bmUsAQBCe-V92CFskJHkSfngSP4KSg,8130
 job_shop_lib/dispatching/__init__.py,sha256=xk6NjndZ4-EH5G_fGSEX4LQEXL53TRYn5dKEb5uFggI,1568
-job_shop_lib/dispatching/dispatcher.py,sha256=O9iqytBveJT3WMTELkpNy8IeNiI2Yy8uxbP2ruLLT1A,12582
+job_shop_lib/dispatching/dispatcher.py,sha256=3WdShJtVMP4ZBeoOIegelTXziJLpEjtonAku21yqr20,19299
 job_shop_lib/dispatching/dispatching_rule_solver.py,sha256=fbNfSclH6Jw1F-QGY1oxAj9wm2hHhJHGnsF2HateXX8,4669
 job_shop_lib/dispatching/dispatching_rules.py,sha256=SIDkPx_1uTkM0loEqGMqotLBBSaGi1gH0WS85GXrT_I,5557
 job_shop_lib/dispatching/factories.py,sha256=ldyIbz3QuLuDkrqbgJXV6YoM6AV6CKyHu8z4hXLG2Vo,7267
+job_shop_lib/dispatching/feature_observers/__init__.py,sha256=j7GXFCKK0mLjGc3M6bw2vePZaLyou_9BUjlHtAMriHc,1023
+job_shop_lib/dispatching/feature_observers/composite_feature_observer.py,sha256=wLd5yirDekg_pFrBPWIyxKou8htimvKhtDbz0cJ8SKE,3302
+job_shop_lib/dispatching/feature_observers/duration_observer.py,sha256=EMSfRsWkx94VeOF6v1f2s73hrEQ696vkFoWVVw5tWZ8,3804
+job_shop_lib/dispatching/feature_observers/earliest_start_time_observer.py,sha256=pKrxaLOPHMnf-eniDhkPWVzzRpKLnpbXAeORqEmsrp0,6296
+job_shop_lib/dispatching/feature_observers/factory.py,sha256=XF5spNp8T-dnPPnpWQ5dxuG7vrHLf-Wb8MP1tn4_BXA,1941
+job_shop_lib/dispatching/feature_observers/feature_observer.py,sha256=q2i50LOhgjaQtu_0-3VlSH64uHcf73JddjcGijeKCVk,3646
+job_shop_lib/dispatching/feature_observers/is_completed_observer.py,sha256=6UCxp-QLXxbw_1nppQJuG_qZZvjtGugYTxQdPTcIcgo,4086
+job_shop_lib/dispatching/feature_observers/is_ready_observer.py,sha256=km75Pa8vd55grjvr7X-8e0K9vfxVWfms1ea6kAesKLo,1405
+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=PEC-WwcyeHL8WOACElImDtAAoaf7MroaD9x5QlQddVE,1344
+job_shop_lib/dispatching/feature_observers/remaining_operations_observer.py,sha256=yVde9gC0cheFNCoPa1lFgGSmzyew-zOGA98nZpBBw1I,1891
 job_shop_lib/dispatching/history_tracker.py,sha256=3jSh7pKEGiOcEK6bXK8AQJK4NtASxTknRjmHRKenxt8,649
 job_shop_lib/dispatching/pruning_functions.py,sha256=d94_uBHuESp4NSf_jBk1q8eBCfTPuU9meiL3StiqJiA,4378
 job_shop_lib/exceptions.py,sha256=0Wla1lK6E2u1o3t2hJj9hUwyoJ-1ebkXd42GdXFAhV0,899
@@ -18,20 +29,20 @@ job_shop_lib/generators/basic_generator.py,sha256=pbRDQWC2mnHU0dbc-T8wkdwVeJPlRn
 job_shop_lib/generators/transformations.py,sha256=FI2qHrETATJUrQP3-RYhZAQ5boyEZ0CF2StDbacBej8,5290
 job_shop_lib/graphs/__init__.py,sha256=mWyF0MypyYfvFhy2F93BJkFIVsxS_0ZqvPuc29B7TJg,1454
 job_shop_lib/graphs/build_agent_task_graph.py,sha256=ktj-oNLUPmWHfL81EVyaoF4hXClWYfnN7oG2Nn4pOsg,7128
-job_shop_lib/graphs/build_disjunctive_graph.py,sha256=IRMBtHw8aru5rYGz796-dc6QyaLJFh4LlPlN_BPSq5c,2877
+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=B0buqcg7US6UvIRWsoY8_FwqzPa_nVjnBu7hPIrygUo,7404
 job_shop_lib/graphs/node.py,sha256=FrSndtvqgRbN69jIcU6q1TkBh-LOGg8sxxYjDZqCcf4,5613
-job_shop_lib/job_shop_instance.py,sha256=ZB0NOcTvGSq0zmmxiDceaC0DH9ljpJXD0hfKOmP0jcE,12801
-job_shop_lib/operation.py,sha256=bZclBeyge71Avm9ArwvGuBKZp5Idw5EUm6m35jav0C4,3924
-job_shop_lib/schedule.py,sha256=1xzue2ro927VZw9IWg_tlBLZ7kDbN091aOW6ZMEjOYQ,6509
-job_shop_lib/scheduled_operation.py,sha256=EfG5AcrspjO3erhM2ejlSOtYKNnaNTsLEu2gu2N3FxA,3127
+job_shop_lib/job_shop_instance.py,sha256=awEZ-xKM4yPlD4gE8SdfQdt68CWX_R3IebeVY8ST4bs,16376
+job_shop_lib/operation.py,sha256=S61x0xgu09JLwrRp7syd1P2psbl0ByGuK_hHoHp4ng8,3916
+job_shop_lib/schedule.py,sha256=aODGwMv9slFIqOTCz2hF_EIpXhddz8-iAH5gSzGO5G8,10393
+job_shop_lib/scheduled_operation.py,sha256=qzXzat1dQBbQ-sLyoG1iXbF9eWbdFeZDFjhAFVavHPk,3526
 job_shop_lib/visualization/__init__.py,sha256=Kxjk3ERYXPAHR72nkD92gFdJltSLA2kxLZrlZzZJS8o,693
 job_shop_lib/visualization/agent_task_graph.py,sha256=G-c9eiawz6m9sdnDM1r-ZHz6K-gYDIAreHpb6pkYE7w,8284
-job_shop_lib/visualization/create_gif.py,sha256=KrwMpSYvSCsL5Ld3taiNHSl_QDrODLpqM-MKQG_C2oU,6674
+job_shop_lib/visualization/create_gif.py,sha256=aUB_2ChyFNo4KuKiQl2ANYmVB5NFcGb7pxKeqr0CVJQ,7186
 job_shop_lib/visualization/disjunctive_graph.py,sha256=pg4KG9BfQbnBPnXYgbyPGe0AuHSmhYqPeqWYAf_spWQ,5905
-job_shop_lib/visualization/gantt_chart.py,sha256=OyBMBnjSsRC769qXimJ3IIQWlssgPfx-nlVeSeU5sWY,4415
-job_shop_lib-0.3.0.dist-info/LICENSE,sha256=9mggivMGd5taAu3xbmBway-VQZMBzurBGHofFopvUsQ,1069
-job_shop_lib-0.3.0.dist-info/METADATA,sha256=DPjUe3anmq-s0y-_09o8uBjvFTmHqVt5N_AI3BPu1AM,12624
-job_shop_lib-0.3.0.dist-info/WHEEL,sha256=FMvqSimYX_P7y0a7UY-_Mc83r5zkBZsCYPm7Lr0Bsq4,88
-job_shop_lib-0.3.0.dist-info/RECORD,,
+job_shop_lib/visualization/gantt_chart.py,sha256=B9sn4XrEUqgQhRKju-1VUG5R67AZXRu7jbrtA8VcndU,4412
+job_shop_lib-0.5.0.dist-info/LICENSE,sha256=9mggivMGd5taAu3xbmBway-VQZMBzurBGHofFopvUsQ,1069
+job_shop_lib-0.5.0.dist-info/METADATA,sha256=a_AtBz1LwmfrEoIVWXepewPFx2Pa1QiFJt857kCGncw,12582
+job_shop_lib-0.5.0.dist-info/WHEEL,sha256=FMvqSimYX_P7y0a7UY-_Mc83r5zkBZsCYPm7Lr0Bsq4,88
+job_shop_lib-0.5.0.dist-info/RECORD,,