[Minor] added few more explanations

ai4co · May 12, 2024 · 807f43c · 807f43c
1 parent d94c830
commit 807f43c
Showing 1 changed file with 9 additions and 1 deletion.
diff --git a/examples/other/2-scheduling.ipynb b/examples/other/2-scheduling.ipynb
@@ -277,7 +277,15 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "# Visualize solution construction"
+    "# Visualize solution construction\n",
+    "\n",
+    "Starting at $t=0$, the decoder uses the machine-operation embeddings of the encoder to decide which machine-**job**-combination to schedule next. Note, that due to the precedence relationship, the operations to be scheduled next are fixed per job. Therefore, it is sufficient to determine the next job to be scheduled, which significantly reduces the action space. \n",
+    "\n",
+    "After some operations have been scheduled, either all the machines are busy or all the jobs have been scheduled with their currently active operation. In this case, the environment transitions to a new time step $t$. The new $t$ will be equal to the first time step where a machine finishes an operation in the partial schedule. When an operation is finished, the machine that has processed it is immediately ready to process the next operation. Also, the next operation of the respective job can then be scheduled.\n",
+    "\n",
+    "The start time of an operation is always equal to the time step in which it is scheduled. The finish time of an operation is equal to its start time plus the processing time required by the machine on which it is being processed.\n",
+    "\n",
+    "The figure below visualises this process. "
    ]
   },
   {