diff --git a/implementation.tex b/implementation.tex
index 6234ae4eccc4040929b6472b299d9102d25e2c4f..e8155596712ee7299b6e7f2960dd62bdd0f1ef49 100644
--- a/implementation.tex
+++ b/implementation.tex
@@ -173,10 +173,10 @@ A disadvantage is it does not always find the schedule with the shortest makespa
It is sometimes possible to find shorter schedules by changing the order of tasks.
Consider the scenario in \cref{fig:greedy-fails}.
There are two resources, resource A with one capability capA, and B with one capability capB.
-There are three tasks 1, 2, and 3, where task 1 requires capA and tasks 2 and 3 require capB.
-Furthermore, task 1 is a predecessor of task 2.
+There are the three Tasks 1, 2, and 3, where Task 1 requires capA and Tasks 2 and 3 require capB.
+Furthermore, Task 1 is a predecessor of Task 2.
There exists exactly one valid assignment, namely the one used in \cref{fig:greedy-fails}.
-The greedy schedule builder processes tasks in the order in which they occur, so it fails to see that task 3 could be scheduled at time 0.
+The greedy schedule builder processes tasks in the order in which they occur, so it fails to see that Task 3 can be scheduled at time 0.
\begin{figure}
\centering