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

job_shop_lib/visualization/graphs/_plot_resource_task_graph.py

@@ -0,0 +1,389 @@
+"""Contains functions to plot a resource-task graph representation of a job
+shop instance.
+
+It was introduced by Junyoung Park et al. (2021).
+In contrast to the disjunctive graph, instead of connecting operations that
+share the same resources directly by disjunctive edges, operation nodes are
+connected with machine ones. All machine nodes are connected between them, and
+all operation nodes from the same job are connected by non-directed edges too.
+"""
+
+from collections.abc import Callable
+from copy import deepcopy
+from typing import Optional, Any, Tuple, Dict, Union, List
+
+import matplotlib.pyplot as plt
+import matplotlib.colors as mcolors
+import networkx as nx
+
+from job_shop_lib.graphs import NodeType, JobShopGraph, Node
+
+
+def plot_resource_task_graph(
+    job_shop_graph: JobShopGraph,
+    *,
+    title: Optional[str] = None,
+    figsize: Tuple[int, int] = (10, 10),
+    layout: Optional[Dict[Node, Tuple[float, float]]] = None,
+    node_size: int = 1200,
+    node_font_color: str = "k",
+    font_size: int = 10,
+    alpha: float = 0.95,
+    add_legend: bool = False,
+    node_shapes: Optional[Dict[str, str]] = None,
+    node_color_map: Optional[
+        Callable[[Node], Tuple[float, float, float, float]]
+    ] = None,
+    default_node_color: Union[
+        str, Tuple[float, float, float, float]
+    ] = "lightblue",
+    machine_color_map_name: str = "tab10",
+    legend_text: str = "$p_{ij}$ = duration of $O_{ij}$",
+    edge_additional_params: Optional[Dict[str, Any]] = None,
+    draw_only_one_edge: bool = False,
+) -> plt.Figure:
+    """Returns a plot of the hetereogeneous graph of the instance.
+
+    Machine and job nodes are represented by squares, and the operation nodes
+    are represented by circles.
+
+    Args:
+        job_shop_graph:
+            The job shop graph instance.
+        title:
+            The title of the plot. If ``None``, the title "Heterogeneous Graph
+            Visualization: {instance_name}" is used. The default is ``None``.
+        figsize:
+            The size of the figure. It should be a tuple with the width and
+            height in inches. The default is ``(10, 10)``.
+        layout:
+            A dictionary with the position of each node in the graph. The keys
+            are the node ids, and the values are tuples with the x and y
+            coordinates. If ``None``, the :func:`three_columns_layout` function
+            is used. The default is ``None``.
+        node_size:
+            The size of the nodes. The default is 1000.
+        alpha:
+            The transparency of the nodes. It should be a float between 0 and
+            1. The default is 0.95.
+        add_legend:
+            Whether to add a legend with the meaning of the colors and shapes.
+            The default is ``False``.
+        node_shapes:
+            A dictionary with the shapes of the nodes. The keys are the node
+            types, and the values are the shapes. The default is
+            ``{"machine": "s", "job": "d", "operation": "o", "global": "o"}``.
+        node_color_map:
+            A function that receives a node and returns a tuple with the RGBA
+            values of the color to use in the plot. If ``None``,
+            :func:`color_nodes_by_machine` is used.
+        machine_color_map_name:
+            The name of the colormap to use for the machines. This argument is
+            only used if ``node_color_map`` is ``None``. The default is
+            ``"tab10"``.
+
+    Returns:
+        The figure of the plot. This figure can be used to save the plot to a
+        file or to show it in a Jupyter notebook.
+    """
+    if title is None:
+        title = (
+            "Heterogeneous Graph Visualization:"
+            f"{job_shop_graph.instance.name}"
+        )
+    # Create a new figure and axis
+    fig, ax = plt.subplots(figsize=figsize)
+    fig.suptitle(title)
+
+    # Create the networkx graph
+    graph = job_shop_graph.graph
+    nodes = job_shop_graph.non_removed_nodes()
+
+    # Create the layout if it was not provided
+    if layout is None:
+        layout = three_columns_layout(job_shop_graph)
+
+    # Define colors and shapes
+    color_map = plt.get_cmap(machine_color_map_name)
+    machine_colors = {
+        machine.machine_id: color_map(i)
+        for i, machine in enumerate(
+            job_shop_graph.nodes_by_type[NodeType.MACHINE]
+        )
+    }
+    node_color_map = (
+        color_nodes_by_machine(machine_colors, default_node_color)
+        if node_color_map is None
+        else node_color_map
+    )
+    node_colors = [
+        node_color_map(node) for node in job_shop_graph.nodes
+    ]  # We need to get the color of all nodes to avoid an index error
+    if node_shapes is None:
+        node_shapes = {
+            "machine": "s",
+            "job": "d",
+            "operation": "o",
+            "global": "o",
+        }
+
+    # Draw nodes with different shapes based on their type
+    for node_type, shape in node_shapes.items():
+        current_nodes = [
+            node.node_id
+            for node in nodes
+            if node.node_type.name.lower() == node_type
+        ]
+        nx.draw_networkx_nodes(
+            graph,
+            layout,
+            nodelist=current_nodes,
+            node_color=[node_colors[i] for i in current_nodes],
+            node_shape=shape,
+            ax=ax,
+            node_size=node_size,
+            alpha=alpha,
+        )
+
+    # Draw edges
+    if edge_additional_params is None:
+        edge_additional_params = {}
+    if draw_only_one_edge:
+        graph = deepcopy(graph)
+        edges = list(graph.edges)
+        present_edges = set()
+        for edge in edges:
+            unorder_edge = frozenset(edge)
+            if unorder_edge in present_edges:
+                graph.remove_edge(*edge)
+            else:
+                present_edges.add(unorder_edge)
+
+    nx.draw_networkx_edges(graph, layout, ax=ax, **edge_additional_params)
+
+    node_color_map = (
+        color_nodes_by_machine(machine_colors, "lightblue")
+        if node_color_map is None
+        else node_color_map
+    )
+    node_labels = {node.node_id: _get_node_label(node) for node in nodes}
+    nx.draw_networkx_labels(
+        graph,
+        layout,
+        node_labels,
+        ax=ax,
+        font_size=font_size,
+        font_color=node_font_color,
+    )
+
+    ax.set_axis_off()
+
+    plt.tight_layout()
+
+    # Add to the legend the meaning of m and d
+    if add_legend:
+        plt.figtext(0, 0.95, legend_text, wrap=True, fontsize=12)
+    return fig
+
+
+def _get_node_label(node: Node) -> str:
+    if node.node_type == NodeType.OPERATION:
+        i = node.operation.job_id
+        j = node.operation.position_in_job
+        ij = str(i) + str(j)
+        return f"$p_{{{ij}}}={node.operation.duration}$"
+    if node.node_type == NodeType.MACHINE:
+        return f"$M_{node.machine_id}$"
+    if node.node_type == NodeType.JOB:
+        return f"$J_{node.job_id}$"
+    if node.node_type == NodeType.GLOBAL:
+        return "$G$"
+
+    raise ValueError(f"Invalid node type: {node.node_type}")
+
+
+def _color_to_rgba(
+    color: Union[str, Tuple[float, float, float, float]]
+) -> Tuple[float, float, float, float]:
+    if isinstance(color, str):
+        return mcolors.to_rgba(color)
+    return color
+
+
+def color_nodes_by_machine(
+    machine_colors: Dict[int, Tuple[float, float, float, float]],
+    default_color: Union[str, Tuple[float, float, float, float]],
+) -> Callable[[Node], Tuple[float, float, float, float]]:
+    """Returns a function that assigns a color to a node based on its type.
+
+    The function returns a color based on the node type. If the node is an
+    operation, the color is based on the machine it is assigned to. If the node
+    is a machine, the color is based on the machine id. If the node is a job or
+    global node, the color is the default color.
+
+    Args:
+        machine_colors:
+            A dictionary with the colors of each machine. The keys are the
+            machine ids, and the values are tuples with the RGBA values.
+        default_color:
+            The default color to use for job and global nodes. It can be a
+            string with a color name or a tuple with the RGBA values.
+
+    Returns:
+        A function that receives a node and returns a tuple with the RGBA
+        values of the color to use in the plot.
+    """
+
+    def _get_node_color(node: Node) -> Tuple[float, float, float, float]:
+        if node.node_type == NodeType.OPERATION:
+            return machine_colors[node.operation.machine_id]
+        if node.node_type == NodeType.MACHINE:
+            return machine_colors[node.machine_id]
+
+        return _color_to_rgba(default_color)
+
+    return _get_node_color
+
+
+def three_columns_layout(
+    job_shop_graph: JobShopGraph,
+    *,
+    leftmost_position: float = 0.1,
+    rightmost_position: float = 0.9,
+    topmost_position: float = 1.0,
+    bottommost_position: float = 0.0,
+) -> Dict[Node, Tuple[float, float]]:
+    """Generates coordinates for a three-column grid layout.
+
+    1. Left column: Machine nodes (M1, M2, etc.)
+    2. Middle column: Operation nodes (O_ij where i=job, j=operation)
+    3. Right column: Job nodes (J1, J2, etc.)
+
+    The operations are arranged vertically in groups by job, with a global
+    node (G) at the bottom.
+
+    For example, in a 2-machine, 3-job problem:
+
+    - Machine nodes (M1, M2) appear in the left column where needed
+    - Operation nodes (O_11 through O_33) form the central column
+    - Job nodes (J1, J2, J3) appear in the right column at the middle of their
+      respective operations
+    - The global node (G) appears at the bottom of the middle column
+
+    Args:
+        job_shop_graph:
+            The job shop graph instance. It should be already initialized with
+            the instance with a valid agent-task graph representation.
+        leftmost_position:
+            The center position of the leftmost column of the layout. It should
+            be a float between 0 and 1. The default is 0.1.
+        rightmost_position:
+            The center position of the rightmost column of the layout. It
+            should be a float between 0 and 1. The default is 0.9.
+        topmost_position:
+            The center position of the topmost node of the layout. It should be
+            a float between 0 and 1. The default is 0.9.
+        bottommost_position:
+            The center position of the bottommost node of the layout. It should
+            be a float between 0 and 1. The default is 0.1.
+
+    Returns:
+        A dictionary with the position of each node in the graph. The keys are
+        the node ids, and the values are tuples with the x and y coordinates.
+    """
+
+    x_positions = _get_x_positions(leftmost_position, rightmost_position)
+
+    operation_nodes = [
+        node
+        for node in job_shop_graph.nodes_by_type[NodeType.OPERATION]
+        if not job_shop_graph.is_removed(node)
+    ]
+    machine_nodes = [
+        node
+        for node in job_shop_graph.nodes_by_type[NodeType.MACHINE]
+        if not job_shop_graph.is_removed(node)
+    ]
+    job_nodes = [
+        node
+        for node in job_shop_graph.nodes_by_type[NodeType.JOB]
+        if not job_shop_graph.is_removed(node)
+    ]
+    global_nodes = [
+        node
+        for node in job_shop_graph.nodes_by_type[NodeType.GLOBAL]
+        if not job_shop_graph.is_removed(node)
+    ]
+
+    # job_nodes = job_shop_graph.nodes_by_type[NodeType.JOB]
+    # global_nodes = job_shop_graph.nodes_by_type[NodeType.GLOBAL]
+
+    total_positions = len(operation_nodes) + len(global_nodes) * 2
+    y_spacing = (topmost_position - bottommost_position) / total_positions
+
+    layout: Dict[Node, Tuple[float, float]] = {}
+
+    machines_spacing_multiplier = len(operation_nodes) // len(machine_nodes)
+    layout.update(
+        _assign_positions_from_top(
+            machine_nodes,
+            x_positions["machine"],
+            topmost_position,
+            y_spacing * machines_spacing_multiplier,
+        )
+    )
+    layout.update(
+        (
+            _assign_positions_from_top(
+                operation_nodes,
+                x_positions["operation"],
+                topmost_position,
+                y_spacing,
+            )
+        )
+    )
+
+    if global_nodes:
+        layout[global_nodes[0]] = (
+            x_positions["operation"],
+            bottommost_position,
+        )
+
+    if job_nodes:
+        job_multiplier = len(operation_nodes) // len(job_nodes)
+        layout.update(
+            _assign_positions_from_top(
+                job_nodes,
+                x_positions["job"],
+                topmost_position,
+                y_spacing * job_multiplier,
+            )
+        )
+    return layout
+
+
+def _get_x_positions(
+    leftmost_position: float, rightmost_position: float
+) -> Dict[str, float]:
+    center_position = (
+        leftmost_position + (rightmost_position - leftmost_position) / 2
+    )
+    return {
+        "machine": leftmost_position,
+        "operation": center_position,
+        "job": rightmost_position,
+    }
+
+
+def _assign_positions_from_top(
+    nodes: List[Node],
+    x: float,
+    top: float,
+    y_spacing: float,
+) -> Dict[Node, Tuple[float, float]]:
+    layout: Dict[Node, Tuple[float, float]] = {}
+    for i, node in enumerate(nodes):
+        y = top - (i + 1) * y_spacing
+        layout[node] = (x, y)
+
+    return layout

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: job-shop-lib
-Version: 0.5.0
+Version: 1.0.0
 Summary: An easy-to-use and modular Python library for the Job Shop Scheduling Problem (JSSP)
 License: MIT
 Author: Pabloo22
@@ -12,47 +12,86 @@ Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Provides-Extra: pygraphviz
-Requires-Dist: imageio (>=2,<3)
+Requires-Dist: gymnasium (>=0.29.1,<0.30.0)
+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,<2.0.0)
-Requires-Dist: ortools (>=9.9,<9.10)
+Requires-Dist: ortools (>=9.9,<10.0)
 Requires-Dist: pyarrow (>=15.0.0,<16.0.0)
 Requires-Dist: pygraphviz (>=1.12,<2.0) ; extra == "pygraphviz"
 Description-Content-Type: text/markdown
 
 <div align="center">
 
-<img src="images/logo_with_transparent_background.png" height="150px">
+<img src="docs/source/images/jslib_minimalist_logo_no_background_fixed.png" height="150px">
 
-<h1>Job Shop Library</h1>
+<h1>JobShopLib</h1>
 
 [![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)
 ![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)
 
 </div>
 
-An easy-to-use and modular Python library for the Job Shop Scheduling Problem (JSSP) with a special focus on graph representations.
+JobShopLib is a Python package for creating, solving, and visualizing job shop scheduling problems (JSSP).
 
-It provides intuitive data structures to represent instances and solutions, as well as solvers and visualization tools.
+It follows a modular design, allowing users to easily extend the library with new solvers, dispatching rules, visualization functions, etc.
 
-See the [this](https://colab.research.google.com/drive/1XV_Rvq1F2ns6DFG8uNj66q_rcowwTZ4H?usp=sharing) Google Colab notebook for a quick start guide! 
+See the [documentation](https://job-shop-lib.readthedocs.io/en/latest/) for more details about the latest version.
 
-## Installation
+## Installation :package:
 
-You can install the library from PyPI:
+<!-- start installation -->
+
+JobShopLib is distributed on [PyPI](https://pypi.org/project/job-shop-lib/) and it supports Python 3.10+.
+
+You can install the latest stable version (version 0.5.1) using `pip`:
 
 ```bash
 pip install job-shop-lib
 ```
 
-## Quick Start :rocket:
+See [this](https://colab.research.google.com/drive/1XV_Rvq1F2ns6DFG8uNj66q_rcowwTZ4H?usp=sharing) Google Colab notebook for a quick start guide! 
+
+
+There is a [documentation page](https://job-shop-lib.readthedocs.io/en/latest/) for versions 1.0.0a3 and onward. See see the [latest pull requests](https://github.com/Pabloo22/job_shop_lib/pulls?q=is%3Apr+is%3Aclosed) for the latest changes.
+
+<!-- end installation -->
+
+<!-- key features -->
+
+## Key Features :star:
+
+- **Data Structures**: Easily create, manage, and manipulate job shop instances and solutions with user-friendly data structures. See [Getting Started](https://github.com/Pabloo22/job_shop_lib/blob/main/docs/source/tutorial/00-Getting-Started.ipynb) and [How Solutions are Represented](https://github.com/Pabloo22/job_shop_lib/blob/main/docs/source/tutorial/01-How-Solutions-are-Represented.ipynb).
+
+- **Benchmark Instances**: Load well-known benchmark instances directly from the library without manual downloading. See [Load Benchmark Instances](https://github.com/Pabloo22/job_shop_lib/blob/main/docs/source/examples/05-Load-Benchmark-Instances.ipynb).
+
+- **Random Instance Generation**: Create random instances with customizable sizes and properties or augment existing ones. See [`generation`](job_shop_lib/generation) package.
+
+- **Multiple Solvers**:
+  - **Constraint Programming Solver**: OR-Tools' CP-SAT solver. See [Solving the Problem](https://github.com/Pabloo22/job_shop_lib/blob/main/docs/source/tutorial/02-Solving-the-Problem.ipynb).
+
+  - **Dispatching Rule Solvers**: Use any of the available dispatching rules or create custom ones. See [Dispatching Rules](https://github.com/Pabloo22/job_shop_lib/blob/main/docs/source/examples/03-Dispatching-Rules.ipynb).
+
+- **Gantt Charts**: Visualize final schedules and how are they created iteratively by dispatching rule solvers or sequences of scheduling decisions with GIFs or videos. See [Save Gif](https://github.com/Pabloo22/job_shop_lib/blob/main/docs/source/examples/06-Save-Gif.ipynb).
+
+- **Graph Representations**:
+  - **Disjunctive Graphs**: Represent and visualize instances as disjunctive graphs. See [Disjunctive Graph](https://github.com/Pabloo22/job_shop_lib/blob/main/docs/source/examples/04-Disjunctive-Graph.ipynb).
+  - **Agent-Task Graphs**: Encode instances as agent-task graphs (introduced in [ScheduleNet paper](https://arxiv.org/abs/2106.03051)). See [Agent-Task Graph](https://github.com/Pabloo22/job_shop_lib/blob/main/docs/source/examples/07-Agent-Task-Graph.ipynb).
+  - Build your own custom graphs with the `JobShopGraph` class.
+
+- **Gymnasium Environments**: Two environments for solving the problem with graph neural networks (GNNs) or any other method, and reinforcement learning (RL). See [SingleJobShopGraphEnv](https://github.com/Pabloo22/job_shop_lib/blob/main/docs/source/examples/09-SingleJobShopGraphEnv.ipynb) and [MultiJobShopGraphEnv](https://github.com/Pabloo22/job_shop_lib/blob/main/docs/source/examples/10-MultiJobShopGraphEnv.ipynb).
+
+<!-- end key features -->
+
+## Some Examples :rocket:
 
 ### Create a Job Shop Instance
 
-You can create a Job Shop Instance by defining the jobs and operations. An operation is defined by the machine(s) it is processed on and the duration (processing time).
+You can create a `JobShopInstance` by defining the jobs and operations. An operation is defined by the machine(s) it is processed on and the duration (processing time).
 
 ```python
 from job_shop_lib import JobShopInstance, Operation
@@ -83,7 +122,7 @@ from job_shop_lib.benchmarking import load_benchmark_instance
 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
+The module `benchmarking` contains functions to load the instances from the file and return them as `JobShopInstance` objects without having to download them
 manually.
 
 The contributions to this benchmark dataset are as follows:
@@ -115,12 +154,12 @@ https://github.com/thomasWeise/jsspInstancesAndResults
 
 ### Generate a Random Instance
 
-You can also generate a random instance with the `BasicGenerator` class.
+You can also generate a random instance with the `GeneralInstanceGenerator` class.
 
 ```python
-from job_shop_lib.generators import BasicGenerator
+from job_shop_lib.generation import GeneralInstanceGenerator
 
-generator = BasicGenerator(
+generator = GeneralInstanceGenerator(
     duration_range=(5, 10), seed=42, num_jobs=5, num_machines=5
 )
 random_instance = generator.generate()
@@ -129,7 +168,7 @@ random_instance = generator.generate()
 This class can also work as an iterator to generate multiple instances:
 
 ```python
-generator = BasicGenerator(iteration_limit=100, seed=42)
+generator = GeneralInstanceGenerator(iteration_limit=100, seed=42)
 instances = []
 for instance in generator:
     instances.append(instance)
@@ -145,7 +184,7 @@ Every solver is a `Callable` that receives a `JobShopInstance` and returns a `Sc
 ```python
 import matplotlib.pyplot as plt
 
-from job_shop_lib.cp_sat import ORToolsSolver
+from job_shop_lib.constraint_programming import ORToolsSolver
 from job_shop_lib.visualization import plot_gantt_chart
 
 solver = ORToolsSolver(max_time_in_seconds=10)
@@ -154,7 +193,7 @@ ft06_schedule = solver(ft06)
 fig, ax = plot_gantt_chart(ft06_schedule)
 plt.show()
 ```
-![Example Gannt Chart](images/ft06_solution.png)
+![Example Gannt Chart](docs/source/images/ft06_solution.png)
 
 ### Solve an Instance with a Dispatching Rule Solver
 
@@ -190,7 +229,7 @@ create_gif(
 )
 ```
 
-![Example Gif](examples/ft06_optimized.gif)
+![Example Gif](docs/source/examples/output/ft06_optimized.gif)
 
 The dashed red line represents the current time step, which is computed as the earliest time when the next operation can start.
 
@@ -200,7 +239,7 @@ The dashed red line represents the current time step, which is computed as the e
 
 ### Representing Instances as Graphs
 
-One of the main purposes of this library is to provide an easy way to encode instances as graphs. This can be very useful, not only for visualization purposes but also for developing Graph Neural Network-based algorithms.
+One of the main purposes of this library is to provide an easy way to encode instances as graphs. This can be very useful, not only for visualization purposes but also for developing graph neural network-based algorithms.
 
 A graph is represented by the `JobShopGraph` class, which internally stores a `networkx.DiGraph` object.
 
@@ -208,7 +247,7 @@ A graph is represented by the `JobShopGraph` class, which internally stores a `n
 
 The disjunctive graph is created by first adding nodes representing each operation in the jobs, along with two special nodes: a source $S$ and a sink $T$. Each operation node is linked to the next operation in its job sequence by **conjunctive edges**, forming a path from the source to the sink. These edges represent the order in which operations of a single job must be performed.
 
-Additionally, the graph includes **disjunctive edges** between operations that use the same machine but belong to different jobs. These edges are bidirectional, indicating that either of the connected operations can be performed first. The disjunctive edges thus represent the scheduling choices available: the order in which operations sharing a machine can be processed. Solving the Job Shop Scheduling problem involves choosing a direction for each disjunctive edge such that the overall processing time is minimized.
+Additionally, the graph includes **disjunctive edges** between operations that use the same machine but belong to different jobs. These edges are bidirectional, indicating that either of the connected operations can be performed first. The disjunctive edges thus represent the scheduling choices available: the order in which operations sharing a machine can be processed. Solving the job shop scheduling problem involves choosing a direction for each disjunctive edge such that the overall processing time is minimized.
 
 ```python
 from job_shop_lib.visualization import plot_disjunctive_graph
@@ -217,11 +256,11 @@ fig = plot_disjunctive_graph(instance)
 plt.show()
 ```
 
-![Example Disjunctive Graph](images/example_disjunctive_graph.png)
+![Example Disjunctive Graph](docs/source/images/example_disjunctive_graph.png)
 
 
-> [!WARNING]
-> This plot function requires having the optional dependency [PyGraphViz](https://pygraphviz.github.io/) installed.
+> [!TIP]
+> Installing the optional dependency [PyGraphViz](https://pygraphviz.github.io/) is recommended.
 
 The `JobShopGraph` class provides easy access to the nodes, for example, to get all the nodes of a specific type:
 
@@ -250,9 +289,9 @@ Other attributes include:
 - `nodes_by_machine`: A nested list mapping each machine to its associated operation nodes, aiding in machine-specific analysis.
 - `nodes_by_job`: Similar to `nodes_by_machine`, but maps jobs to their operation nodes, useful for job-specific traversal.
 
-#### Agent-Task Graph
+#### Resource-Task Graph
 
-Introduced in the paper "ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning" by [Park et al. (2021)](https://arxiv.org/abs/2106.03051), the Agent-Task Graph is a graph that represents the scheduling problem as a multi-agent reinforcement learning problem.
+Introduced in the paper "ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning" by [Park et al. (2021)](https://arxiv.org/abs/2106.03051), the resource-task graph (orginally named "agent-task graph") is a graph that represents the scheduling problem as a multi-agent reinforcement learning problem.
 
 In contrast to the disjunctive graph, instead of connecting operations
 that share the same resources directly by disjunctive edges, operation
@@ -263,66 +302,59 @@ from the same job are connected by non-directed edges too.
 
 ```python
 from job_shop_lib.graphs import (
-    build_complete_agent_task_graph,
-    build_agent_task_graph_with_jobs,
-    build_agent_task_graph,
+    build_complete_resource_task_graph,
+    build_resource_task_graph_with_jobs,
+    build_resource_task_graph,
 )
-from job_shop_lib.visualization import plot_agent_task_graph
+from job_shop_lib.visualization import plot_resource_task_graph
 
-complete_agent_task_graph = build_complete_agent_task_graph(instance)
+complete_resource_task_graph = build_complete_resource_task_graph(instance)
 
-fig = plot_agent_task_graph(complete_agent_task_graph)
+fig = plot_resource_task_graph(complete_agent_task_graph)
 plt.show()
 ```
 
 <div align="center">
-<img src="examples/agent_task_graph.png" width="300">
+<img src="docs/source/examples/output/agent_task_graph.png" width="300">
 </div>
 <br>
 
 ----
 
+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.
 
 ## Installation for development
 
-### With Poetry
+<!-- start installation development -->
 
 1. Clone the repository.
 
-2. Install [poetry](https://python-poetry.org/docs/) if you don't have it already:
-```bash
-pip install poetry==1.7
-```
-3. Create the virtual environment:
 ```bash
-poetry shell
+git clone https://github.com/Pabloo22/job_shop_lib.git
+cd job_shop_lib
 ```
-4. Install dependencies:
+
+2. Install [poetry](https://python-poetry.org/docs/) if you don't have it already:
+
 ```bash
-poetry install --with notebooks --with test --with lint --all-extras
+pip install poetry
 ```
-or equivalently:
+
+3. Install dependencies:
 ```bash
 make poetry_install_all 
 ```
 
-### With PyPI
-
-If you don't want to use Poetry, you can install the library directly from the source code:
-
-```bash
-git clone https://github.com/Pabloo22/job_shop_lib.git
-cd job_shop_lib
-pip install -e .
-```
+<!-- end installation development -->
 
-## License
+## License :scroll:
 
 This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.
 
 
-## References
+## References :books:
 
  - J. Adams, E. Balas, and D. Zawack, "The shifting bottleneck procedure
      for job shop scheduling," Management Science, vol. 34, no. 3,