final bijna

[ar1516.git] / 3.tex

diff --git a/3.tex b/3.tex
index 8a4703a..9f24095 100644 (file)
--- a/3.tex
+++ b/3.tex
@@ -55,7 +55,8 @@ conversion and said script is listed in Listing~\ref{listing:a3.bash}. The
 script optimizes a little bit from the original formula by leaving out the
 shared resource checking for the same jobs. The minimization is done by
 incrementing variable $T$ every time the current $T$ yields unsat with a bash
-script shown in Listing~\ref{listing:3.bash}.
+script shown in Listing~\ref{listing:3.bash} and visualized with the python
+script shown in Listing~\ref{listing:a3.py}.
 
 \lstinputlisting[language=bash,firstline=46,
        caption={Iteratively find the shortest solution for problem 3},
@@ -63,8 +64,10 @@ script shown in Listing~\ref{listing:3.bash}.
 
 \subsection{Solution}
 The bash script finds and shows the minimal solution in which all jobs are
-finished in $37$ time units. Finding this solution takes less then $0.85$
-seconds and is shown in Figure~\ref{tab:s3}. 
+finished in $37$ time units. Finding this solution takes less then $0.42$
+seconds and is shown in Table~\ref{tab:s3}. 
+
+The bold items represent the jobs using shared resources.
 
 \begin{table}[H]
        \centering